Sciweavers

2766 search results - page 194 / 554
» Algorithms for trigonometric polynomials
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 4 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
IJCV
2012
13 years 7 months ago
Globally Optimal Estimation of Nonrigid Image Distortion
Abstract Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps...
Yuandong Tian, Srinivasa G. Narasimhan
146
Voted
ICCV
2003
IEEE
16 years 6 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
STOC
2006
ACM
115views Algorithms» more  STOC 2006»
16 years 4 months ago
Zero knowledge with efficient provers
We prove that every problem in NP that has a zero-knowledge proof also has a zero-knowledge proof where the prover can be implemented in probabilistic polynomial time given an NP ...
Minh-Huyen Nguyen, Salil P. Vadhan
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 1 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris