Sciweavers

3422 search results - page 155 / 685
» Random Subset Optimization
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 5 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
ICIP
2009
IEEE
15 years 2 months ago
Informative sensing of natural images
The theory of compressed sensing tells a dramatic story that sparse signals can be reconstructed near-perfectly from a small number of random measurements. However, recent work ha...
Hyun Sung Chang, Yair Weiss, William T. Freeman
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
Ueli M. Maurer, Stefano Tessaro
DAC
2008
ACM
16 years 6 months ago
Modeling of failure probability and statistical design of spin-torque transfer magnetic random access memory (STT MRAM) array fo
: Spin-Torque Transfer Magnetic RAM (STT MRAM) is a promising candidate for future universal memory. It combines the desirable attributes of current memory technologies such as SRA...
Jing Li, Charles Augustine, Sayeef S. Salahuddin, ...
CSR
2007
Springer
15 years 11 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka