3875 search results - page 294 / 775 » Approximation algorithms for the 0-extension problem |
180
Voted
PG
2002
IEEE
15 years 11 months ago
2002
IEEE
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
155
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
185
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
165
click to vote
WINE
2005
Springer
16 years 7 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
172
click to vote
TCS
2011
15 years 1 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...