12519 search results - page 332 / 2504 » Approximation Problems Categories |
153
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...
203
click to vote
APPROX
2004
Springer
16 years 2 days 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 ...
167
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
173
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
178
click to vote
ISAAC
2004
Springer
16 years 1 days 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...