3341 search results - page 343 / 669 » On Bounded Queries and Approximation |
216
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
161
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
174
click to vote
APPROX
2004
Springer
16 years 4 days ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
179
click to vote
ISAAC
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
161
click to vote
SWAT
2004
Springer
16 years 3 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...