4913 search results - page 649 / 983 » Results and Perspectives of the G |
166
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
183
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
173
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
222
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
176
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...