4843 search results - page 218 / 969 » The Shortcut Problem - Complexity and Approximation |
134
click to vote
PG
2002
IEEE
15 years 8 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...
112
Voted
FSTTCS
2006
Springer
15 years 7 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...
149
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
140
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
112
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...