Sciweavers

25 search results - page 5 / 5
» Probabilistic Amplitude Demodulation
Sort
View
ICASSP
2008
IEEE
14 years 6 days ago
Average case analysis of sparse recovery with thresholding : New bounds based on average dictionary coherence
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabi...
Mohammad Golbabaee, Pierre Vandergheynst
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 23 days ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 9 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ISMIR
2005
Springer
172views Music» more  ISMIR 2005»
13 years 11 months ago
Segmentation and Recognition of Tabla Strokes
A system that segments and labels tabla strokes from real performances is described. Performance is evaluated on a large database taken from three performers under different recor...
Parag Chordia
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 10 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or