Sciweavers

70 search results - page 1 / 14
» Optimal reconstruction might be hard
Sort
View
COMPGEOM
2010
ACM
13 years 9 months ago
Optimal reconstruction might be hard
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
Dominique Attali, André Lieutier
CORR
2008
Springer
144views Education» more  CORR 2008»
13 years 4 months ago
Iterative Hard Thresholding for Compressed Sensing
Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal reconstruction of the signal. In this paper we present ...
Thomas Blumensath, Mike E. Davies
FOCS
2008
IEEE
13 years 4 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
GECCO
2003
Springer
13 years 10 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
IPMI
2005
Springer
13 years 10 months ago
Coil Sensitivity Estimation for Optimal SNR Reconstruction and Intensity Inhomogeneity Correction in Phased Array MR Imaging
Abstract. Magnetic resonance (MR) images can be acquired by multiple receiver coil systems to improve signal-to-noise ratio (SNR) and to decrease acquisition time. The optimal SNR ...
Prashanthi Vemuri, Eugene G. Kholmovski, Dennis L....