 | 2009 |
| 17 |  | Yoram Adler,
Eitan Farchi,
Moshe Klausner,
Dan Pelleg,
Orna Raz,
Moran Shochat,
Shmuel Ur,
Aviad Zlotnick:
Automated substring hole analysis.
ICSE Companion 2009: 203-206 |
| 16 |  | Yoram Adler,
Eitan Farchi,
Moshe Klausner,
Dan Pelleg,
Orna Raz,
Moran Shochat,
Shmuel Ur,
Aviad Zlotnick:
Advanced code coverage analysis using substring holes.
ISSTA 2009: 37-46 |
| 2008 |
| 15 |  | Ari Freund,
Dan Pelleg,
Yossi Richter:
Clustering from Constraint Graphs.
SDM 2008: 301-312 |
| 14 |  | Dan Pelleg,
Muli Ben-Yehuda,
Richard Harper,
Lisa Spainhower,
Tokunbo O. S. Adeshiyan:
Vigilant: out-of-band detection of failures in virtual machines.
Operating Systems Review 42(1): 26-31 (2008) |
| 2007 |
| 13 |  | Dan Pelleg,
Dorit Baras:
K -Means with Large and Noisy Constraint Sets.
ECML 2007: 674-682 |
| 2006 |
| 12 |  | David Carmel,
Elad Yom-Tov,
Adam Darlow,
Dan Pelleg:
What makes a query difficult?
SIGIR 2006: 390-397 |
| 11 |  | Dan Pelleg,
Andrew W. Moore:
Dependency trees in sub-linear time and bounded memory.
VLDB J. 15(3): 250-262 (2006) |
| 2005 |
| 10 |  | Elad Yom-Tov,
David Carmel,
Adam Darlow,
Dan Pelleg,
Shai Errera-Yaakov,
Shai Fine:
Juru at TREC 2005: Query Prediction in the Terabyte and the Robust Tracks.
TREC 2005 |
| 2004 |
| 9 |  | Dan Pelleg,
Andrew W. Moore:
Active Learning for Anomaly and Rare-Category Detection.
NIPS 2004 |
| 2002 |
| 8 |  | Dan Pelleg,
Andrew W. Moore:
Using Tarjan's Red Rule for Fast Dependency Tree Construction.
NIPS 2002: 801-808 |
| 2001 |
| 7 |  | Dan Pelleg,
Andrew W. Moore:
Mixtures of Rectangles: Interpretable Soft Clustering.
ICML 2001: 401-408 |
| 2000 |
| 6 |  | Dan Pelleg,
Andrew W. Moore:
X-means: Extending K-means with Efficient Estimation of the Number of Clusters.
ICML 2000: 727-734 |
| 1999 |
| 5 |  | Dan Pelleg,
Andrew W. Moore:
Accelerating Exact k-means Algorithms with Geometric Reasoning.
KDD 1999: 277-281 |
| 4 |  | Israel Ben-Shaul,
Michael Herscovici,
Michal Jacovi,
Yoëlle S. Maarek,
Dan Pelleg,
Menachem Shtalhaim,
Vladimir Soroka:
Adding Support for Dynamic and Focused Search with Fetuccino.
Computer Networks 31(11-16): 1653-1665 (1999) |
| 1998 |
| 3 |  | Amir Ben-Dor,
Benny Chor,
Dan Graur,
Ron Ophir,
Dan Pelleg:
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution.
RECOMB 1998: 9-19 |
| 2 |  | Michael Herscovici,
Michal Jacovi,
Yoëlle S. Maarek,
Dan Pelleg,
Menachem Shtalhaim,
Sigalit Ur:
The Shark-Search Algorithm. An Application: Tailored Web Site Mapping.
Computer Networks 30(1-7): 317-326 (1998) |
| 1 |  | Amir Ben-Dor,
Benny Chor,
Dan Graur,
Ron Ophir,
Dan Pelleg:
Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships.
Journal of Computational Biology 5(3): 377-390 (1998) |