13214 search results - page 2278 / 2643 » Pseudorandomness for network algorithms |
154
Voted
KDD
2007
ACM
16 years 7 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
167
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
172
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
289
Voted
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
184
Voted
ICIAP
2005
ACM
16 years 7 months ago
2005
ACM
As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative appro...