Sciweavers

12519 search results - page 368 / 2504
» Approximation Problems Categories
Sort
View
COCO
2007
Springer
142views Algorithms» more  COCO 2007»
16 years 27 days ago
Quantum t-designs: t-wise Independence in the Quantum World
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a...
Andris Ambainis, Joseph Emerson
FOCS
1996
IEEE
15 years 11 months ago
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu ...
JAT
2008
100views more  JAT 2008»
15 years 6 months ago
Direct and inverse results in variable Hilbert scales
Variable Hilbert scales are an important tool for the recent analysis of inverse problems in Hilbert spaces, as these constitute a way to describe smoothness of objects other than ...
Peter Mathé, Bernd Hofmann
264
Voted
CVPR
2009
IEEE
1372views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Blind motion deblurring from a single image using sparse approximation
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital imaging. Existing blind deblurring techniques eithe...
Jian-Feng Cai (National University of Singapore), ...
ICCV
1999
IEEE
16 years 8 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih