Sciweavers

3874 search results - page 384 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
16 years 6 days ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
PROCEDIA
2010
75views more  PROCEDIA 2010»
15 years 4 months ago
Two derivative-free optimization algorithms for mesh quality improvement
High-quality meshes are essential in the solution of partial differential equations (PDEs), which arise in numerous science and engineering applications, as the mesh quality aff...
Jeonghyung Park, Suzanne M. Shontz
158
Voted
ANOR
2010
112views more  ANOR 2010»
15 years 4 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
FOCS
2009
IEEE
16 years 29 days ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous
DCOSS
2007
Springer
15 years 10 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev