Sciweavers

7228 search results - page 110 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
TSP
2010
14 years 10 months ago
Coherence-based performance guarantees for estimating a sparse vector under random noise
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
Zvika Ben-Haim, Yonina C. Eldar, Michael Elad
VMV
2001
209views Visualization» more  VMV 2001»
15 years 4 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus
FOCS
2002
IEEE
15 years 8 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
WWW
2010
ACM
15 years 10 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 24 days ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald