9176 search results - page 1642 / 1836 » algorithms 2010 |
217
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
150
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
162
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
167
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
178
click to vote
WDAG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...