280 search results - page 52 / 56 » Approximate nearest neighbors using sparse representations |
109
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
77
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We investigate dynamical models of human motion that can
support both synthesis and analysis tasks. Unlike coarser
discriminative models that work well when action classes are ...
147
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...