Sciweavers

2996 search results - page 313 / 600
» Numberings and Randomness
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 7 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
16 years 3 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu
ICASSP
2009
IEEE
16 years 1 months ago
Field inversion by consensus and compressed sensing
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
Aurora Schmidt, José M. F. Moura
ICC
2009
IEEE
159views Communications» more  ICC 2009»
16 years 1 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...