Sciweavers

7129 search results - page 516 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ECCV
2008
Springer
16 years 9 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
SODA
2010
ACM
148views Algorithms» more  SODA 2010»
16 years 4 months ago
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
Dave Buchfuhrer, Chris Umans
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
16 years 12 days ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
ICES
2003
Springer
151views Hardware» more  ICES 2003»
16 years 7 days ago
Using Genetic Programming and High Level Synthesis to Design Optimized Datapath
This paper presents a methodology to design optimized electronic systems from high abstraction level descriptions. The methodology uses Genetic Programming in addition to high-leve...
Sérgio G. Araújo, Antônio C. M...
COCOON
2006
Springer
15 years 10 months ago
A PTAS for Cutting Out Polygons with Lines
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....
Sergey Bereg, Ovidiu Daescu, Minghui Jiang