Sciweavers

1653 search results - page 64 / 331
» Efficient Multidimensional Sampling
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 9 months ago
Sub-Nyquist Sampling of Short Pulses: Part I
We develop sub-Nyquist sampling systems for analog signals comprised of several, possibly overlapping, finite duration pulses with unknown shapes and time positions. Efficient sam...
Ewa Matusiak, Yonina C. Eldar
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
14 years 11 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 9 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
15 years 10 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 10 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin