Sciweavers

4047 search results - page 293 / 810
» The Discrete Basis Problem
Sort
View
ECCV
2002
Springer
16 years 6 months ago
Minimal Surfaces for Stereo
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
Chris Buehler, Steven J. Gortler, Michael F. Cohen...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 2 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
GECCO
2006
Springer
119views Optimization» more  GECCO 2006»
15 years 8 months ago
Mixed-integer optimization of coronary vessel image analysis using evolution strategies
In this paper we compare Mixed-Integer Evolution Strategies (MI-ES) and standard Evolution Strategies (ES) when applied to find optimal solutions for artificial test problems and ...
Rui Li, Michael Emmerich, Jeroen Eggermont, Ernst ...
FOCS
2007
IEEE
15 years 11 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ASIACRYPT
2006
Springer
15 years 8 months ago
Secure Sketch for Biometric Templates
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
Qiming Li, Yagiz Sutcu, Nasir D. Memon