683 search results - page 72 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
119
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspri...
133
click to vote
FIMI
2003
15 years 5 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
137
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
106
click to vote
JSSPP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper empirically explores the advantages of the collaboration between different parallel compute sites in a decentralized grid scenario. To this end, we assume ind...
172
Voted
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...