6110 search results - page 89 / 1222 » Approximate Computing |
161
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
148
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
205
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
180
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
202
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...