Sciweavers

530 search results - page 79 / 106
» Universal randomized switching
Sort
View
EUROCRYPT
1990
Springer
15 years 6 months ago
Experimental Quantum Cryptography
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a ran...
Charles H. Bennett, François Bessette, Gill...
COLT
2008
Springer
15 years 3 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 3 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
ASE
2010
86views more  ASE 2010»
15 years 2 months ago
Stable rankings for different effort models
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...
Tim Menzies, Omid Jalali, Jairus Hihn, Daniel Bake...
CORR
2010
Springer
114views Education» more  CORR 2010»
15 years 2 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...