Sciweavers

903 search results - page 4 / 181
» On the reduction of a random basis
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
13 years 8 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
ICMCS
2010
IEEE
191views Multimedia» more  ICMCS 2010»
13 years 4 months ago
Disparity-compensated compressed-sensing reconstruction for multiview images
In a multiview-imaging setting, image-acquisition costs could be substantially diminished if some of the cameras operate at a reduced quality. Compressed sensing is proposed to ef...
Maria Trocan, Thomas Maugey, James E. Fowler, B&ea...
SCALESPACE
2007
Springer
14 years 10 days ago
Best Basis Compressed Sensing
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
Gabriel Peyré
CSL
1990
Springer
13 years 10 months ago
On the Reduction Theory for Average Case Complexity
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Andreas Blass, Yuri Gurevich