Eli Shamir - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2013

Pumping, Shrinking and Pronouns: From Context Free to Indexed GrammarsEli Shamir. LATA 2013: 516-522 [doi]

2011

Cross-partition clustering: revealing corresponding themes across related datasetsZvika Marx, Ido Dagan, Eli Shamir. jetai, 23(2):153-180, 2011. [doi]

2007

Reader-based exploration of lexical cohesionBeata Beigman Klebanov, Eli Shamir. lre, 41(1):27-44, 2007. [doi]

2006

On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case StudyBeata Beigman Klebanov, Eli Shamir. nlucs 2006: 109-119

Reader-based exploration of lexical cohesionBeata Beigman Klebanov, Eli Shamir. lre, 40(2):109-126, 2006. [doi]

Satisfiability Decay along Conjunctions of Pseudo-Random ClausesEli Shamir. igpl, 14(5):815-825, 2006. [doi]

2005

Lexical Cohesion: Some Implications of an Empirical StudyBeata Beigman Klebanov, Eli Shamir. nlucs 2005: 13-21

A Generalized Framework for Revealing Analogous Themes across Related TopicsZvika Marx, Ido Dagan, Eli Shamir. naacl 2005: 979-986 [doi]

2003

Identifying Structure across Pre-partitioned DataZvika Marx, Ido Dagan, Eli Shamir. nips 2004: 489-496 [doi]

2002

Cross-dataset Clustering: Revealing Corresponding Themes across Multiple CorporaIdo Dagan, Zvika Marx, Eli Shamir. conll 2002: [doi]

Query by committee, linear separation and random walksShai Fine, Ran Gilad-Bachrach, Eli Shamir. TCS, 284(1):25-51, 2002. [doi]

Coupled Clustering: A Method for Detecting Structural CorrespondenceZvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir. jmlr, 3:747-780, 2002. [doi]

2000

Branching-Depth HierarchiesShoham Shamir, Orna Kupferman, Eli Shamir. ENTCS, 39(1):65-78, 2000. [doi]

1999

1997

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with NoiseNicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans-Ulrich Simon. eurocolt 1997: 119-133

Selective Sampling Using the Query by Committee AlgorithmYoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby. ml, 28(2-3):133-168, 1997.

Learning with Queries Corrupted by Classification NoiseJeffrey C. Jackson, Eli Shamir, Clara Shwartzman. istcs 1997: 45-53 [doi]

1995

Learning by extended statistical queries and its relation to PAC learningEli Shamir, Clara Shwartzman. eurocolt 1995: 357-366

1994

Near-perfect Token DistributionAndrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. rsa, 5(4):559-572, 1994.

Finding Hidden Hamiltonian CyclesAndrei Z. Broder, Alan M. Frieze, Eli Shamir. rsa, 5(3):395-411, 1994.

1993

A note on a counting problem arising in percolation theoryRafi Levy, Eli Shamir. DM, 114(1-3):361-365, 1993. [doi]

1992

Near-perfect Token DistributionAndrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. icalp 1992: 308-317

Information, Prediction, and Query by CommitteeYoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby. nips 1993: 483-490 [doi]

1991

Finding Hidden Hamiltonian Cycles (Extended Abstract)Andrei Z. Broder, Alan M. Frieze, Eli Shamir. stoc 1991: 182-189

1989

Chromatic Numbers of Random Hypergraphs and Associated GraphsEli Shamir. acr, 5:127-142, 1989.

Communication Aspects of Networks Based on Geometric Incidence RelationsEli Shamir, Assaf Schuster. TCS, 64(1):83-96, 1989.

1987

On the Second Eigenvalue of Random Regular Graphs (Preliminary Version)Andrei Z. Broder, Eli Shamir. focs 1987: 286-294

Sharp concentration of the chromatic number on random graphs G::n, p::Eli Shamir, Joel Spencer. combinatorica, 7(1):121-129, 1987.

A Probabilistic Approach to the Load-Sharing Problem in Distributed SystemsEli Shamir, Eli Upfal. jpdc, 4(5):521-530, 1987.

1985

Random hypergraph coloring algorithms and the weak chromatic numberJeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal. jgt, 9(3):347-362, 1985. [doi]

Component structure in the evolution of random hypergraphsJeanette P. Schmidt, Eli Shamir. combinatorica, 5(1):81-94, 1985.

1984

From Expanders to Better Superconcentrators without CascadingEli Shamir. STACS 1984: 121-128

Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph SpacesEli Shamir, Eli Upfal. jal, 5(4):488-501, 1984.

1983

A threshold for perfect matchings in random d-pure hypergraphsJeanette P. Schmidt, Eli Shamir. DM, 45(2-3):287-295, 1983. [doi]

How many random edges make a graph Hamiltonian?Eli Shamir. combinatorica, 3(1):123-131, 1983.

A Fast Construction oF Disjoint Paths in Communication NetworksEli Shamir, Eli Upfal. fct 1983: 428-438

1982

N-Processors Graph Distributively Achieve Perfect Matchings in O(log²N) BeatsEli Shamir, Eli Upfal. podc 1982: 238-241

One-factor in random graphs based on vertex choiceEli Shamir, Eli Upfal. DM, 41(3):281-286, 1982. [doi]

1980

An Improved Program for Constructing Open Hash TablesJeanette P. Schmidt, Eli Shamir. icalp 1980: 569-581

On the Depth Complexity of FormulasEli Shamir, Marc Snir. mst, 13:301-322, 1980.

Sign in or sign up to see more results.

runs on WebDSL