Sciweavers

3495 search results - page 199 / 699
» On the random satisfiable process
Sort
View
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 9 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ICIP
2003
IEEE
16 years 8 months ago
Image features that draw fixations
The ability to automatically detect `visually interesting' regions in an image has many practical applications especially in the design of active machine vision systems. This...
Umesh Rajashekar, Lawrence K. Cormack, Alan C. Bov...
ICASSP
2008
IEEE
16 years 1 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
166
Voted
ICASSP
2008
IEEE
16 years 1 months ago
Belief propagation distributed estimation in sensor networks: An optimized energy accuracy tradeoff
The estimation error performance of Gaussian belief propagation based distributed estimation in a large sensor network employing random sleep strategies is explicitly evaluated fo...
John MacLaren Walsh, Phillip A. Regalia
CPAIOR
2007
Springer
16 years 1 months ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
Sivan Sabato, Yehuda Naveh