Sciweavers

1329 search results - page 154 / 266
» Randomly Sampling Molecules
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Subspace compressive detection for sparse signals
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
Zhongmin Wang, Gonzalo R. Arce, Brian M. Sadler
ICASSP
2008
IEEE
14 years 4 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
CAAN
2004
Springer
14 years 3 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
14 years 3 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
14 years 2 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...