7930 search results - page 664 / 1586 » Greedy in Approximation Algorithms |
197
Voted
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
191
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
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...
139
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
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...
192
click to vote
ISAAC
2004
Springer
16 years 20 days ago
2004
Springer
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...
211
Voted
ICES
2003
Springer
16 years 15 days ago
2003
Springer
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...