Sciweavers

447 search results - page 24 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
CAD
2006
Springer
13 years 7 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
COMPGEOM
2004
ACM
14 years 25 days ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
MIRAGE
2007
Springer
14 years 1 months ago
A Note on the Discrete Binary Mumford-Shah Model
Abstract. This paper is concerned itself with the analysis of the twophase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It c...
Jérôme Darbon
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 4 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