Sciweavers

530 search results - page 98 / 106
» Universal randomized switching
Sort
View
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 9 days ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 days ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 12 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 12 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
MSWIM
2009
ACM
15 years 6 months ago
Designing an asynchronous group communication middleware for wireless users
We evaluate an asynchronous gossiping middleware for wireless users that propagates messages from any group member to all the other group members. This propagation can either be i...
Xuwen Yu, Surendar Chandra