131 search results - page 24 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
133
click to vote
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
115
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
132
click to vote
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
137
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
119
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...