Eli Shamir - RankMe

51 papers A* 8A 1B 2C 2Journal 27Unranked 11

Year	Rank	Type	Title / Venue / Authors
2018	C	`conf`	Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. LATA Eli Shamir
2017	J	`jnl`	Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. Eli Shamir, Benny Sudakov
2013	C	`conf`	Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. LATA Eli Shamir
2011	J	`jnl`	Cross-partition clustering: revealing corresponding themes across related datasets. J. Exp. Theor. Artif. Intell. Zvika Marx, Ido Dagan, Eli Shamir
2007	J	`jnl`	Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation Beata Beigman Klebanov, Eli Shamir
2006	—	`conf`	On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study. NLUCS Beata Beigman Klebanov, Eli Shamir
2006	J	`jnl`	Reader-based exploration of lexical cohesion. Lang. Resour. Evaluation Beata Beigman Klebanov, Eli Shamir
2006	J	`jnl`	Satisfiability Decay along Conjunctions of Pseudo-Random Clauses. Log. J. IGPL Eli Shamir
2005	—	`conf`	A Generalized Framework for Revealing Analogous Themes across Related Topics. HLT/EMNLP Zvika Marx, Ido Dagan, Eli Shamir
2005	—	`conf`	Lexical Cohesion: Some Implications of an Empirical Study. NLUCS Beata Beigman Klebanov, Eli Shamir
2003	—	`conf`	Identifying Structure across Pre-partitioned Data. NIPS Zvika Marx, Ido Dagan, Eli Shamir
2002	J	`jnl`	Coupled Clustering: A Method for Detecting Structural Correspondence. J. Mach. Learn. Res. Zvika Marx, Ido Dagan, Joachim M. Buhmann, Eli Shamir
2002	B	`conf`	Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora. CoNLL Ido Dagan, Zvika Marx, Eli Shamir
2002	J	`jnl`	Query by committee, linear separation and random walks. Theor. Comput. Sci. Shai Fine, Ran Gilad-Bachrach, Eli Shamir
2000	—	`conf`	Branching-Depth Hierarchies. EXPRESS Shoham Shamir, Orna Kupferman, Eli Shamir
1999	J	`jnl`	Detecting Sub-Topic Correspondence through Bipartite Term Clustering CoRR Zvika Marx, Ido Dagan, Eli Shamir
1999	J	`jnl`	Learning with Queries Corrupted by Classification Noise. Discret. Appl. Math. Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
1999	—	`conf`	Query by Committee, Linear Separation and Random Walks. EuroCOLT Ran Bachrach, Shai Fine, Eli Shamir
1999	J	`jnl`	Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon
1997	—	`conf`	Learning with Queries Corrupted by Classification Noise. ISTCS Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
1997	—	`conf`	Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon
1997	J	`jnl`	Selective Sampling Using the Query by Committee Algorithm. Mach. Learn. Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby
1995	—	`conf`	Learning by extended statistical queries and its relation to PAC learning. EuroCOLT Eli Shamir, Clara Shwartzman
1994	A*	`ed.`	Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings ICALP Serge Abiteboul, Eli Shamir
1994	J	`jnl`	Finding Hidden Hamiltonian Cycles. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Shamir
1994	J	`jnl`	Near-perfect Token Distribution. Random Struct. Algorithms Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1993	J	`jnl`	A note on a counting problem arising in percolation theory. Discret. Math. Rafi Levy, Eli Shamir
1992	—	`conf`	Information, Prediction, and Query by Committee. NIPS Yoav Freund, H. Sebastian Seung, Eli Shamir, Naftali Tishby
1992	A*	`conf`	Near-perfect Token Distribution. ICALP Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal
1991	A*	`conf`	Finding Hidden Hamiltonian Cycles (Extended Abstract) STOC Andrei Z. Broder, Alan M. Frieze, Eli Shamir
1989	J	`jnl`	Chromatic Numbers of Random Hypergraphs and Associated Graphs. Adv. Comput. Res. Eli Shamir
1989	J	`jnl`	Communication Aspects of Networks Based on Geometric Incidence Relations. Theor. Comput. Sci. Eli Shamir, Assaf Schuster
1988	—	`conf`	Asynchronous dynamics of random Boolean networks. ICNN Craig Gotsman, Eli Shamir, Daniel Lehmann
1987	J	`jnl`	A Probabilistic Approach to the Load-Sharing Problem in Distributed Systems. J. Parallel Distributed Comput. Eli Shamir, Eli Upfal
1987	A*	`conf`	On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) FOCS Andrei Z. Broder, Eli Shamir
1987	J	`jnl`	Sharp concentration of the chromatic number on random graphs G Comb. Eli Shamir, Joel Spencer
1985	J	`jnl`	Component structure in the evolution of random hypergraphs. Comb. Jeanette P. Schmidt, Eli Shamir
1985	J	`jnl`	Random hypergraph coloring algorithms and the weak chromatic number. J. Graph Theory Jeanette Schmidt-Pruzan, Eli Shamir, Eli Upfal
1984	A	`conf`	From Expanders to Better Superconcentrators without Cascading. STACS Eli Shamir
1984	J	`jnl`	Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces. J. Algorithms Eli Shamir, Eli Upfal
1983	B	`conf`	A Fast Construction oF Disjoint Paths in Communication Networks. FCT Eli Shamir, Eli Upfal
1983	J	`jnl`	A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. Jeanette P. Schmidt, Eli Shamir
1983	J	`jnl`	How many random edges make a graph Hamiltonian?. Comb. Eli Shamir
1982	A*	`conf`	N-Processors Graph Distributively Achieve Perfect Matchings in O(log PODC Eli Shamir, Eli Upfal
1982	J	`jnl`	One-factor in random graphs based on vertex choice. Discret. Math. Eli Shamir, Eli Upfal
1981	A*	`conf`	A Direct Dynamic Solution to Range Search and Related Problems for Product Regions FOCS Z. Aviad, Eli Shamir
1980	A*	`conf`	An Improved Program for Constructing Open Hash Tables. ICALP Jeanette P. Schmidt, Eli Shamir
1980	J	`jnl`	On the Depth Complexity of Formulas. Math. Syst. Theory Eli Shamir, Marc Snir
1980	J	`jnl`	Roots of the hardest context free language and other constructs. SIGACT News Haim Gaifman, Eli Shamir
1974	A*	`conf`	Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages. ICALP Eli Shamir, Catriel Beeri
1962	J	`jnl`	A Remark on Discovery Algorithms for Grammars Inf. Control. Eli Shamir