16404 search results - page 2395 / 3281 » A set coverage problem |
219
click to vote
COMPGEOM
2010
ACM
16 years 22 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
271
click to vote
COMPGEOM
2010
ACM
16 years 22 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
227
click to vote
PLDI
2010
ACM
16 years 22 days ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
240
click to vote
CIVR
2010
Springer
16 years 14 days ago
2010
Springer
Interpreting the relevance of a user-contributed tag with respect to the visual content of an image is an emerging problem in social image retrieval. In the literature this proble...
192
click to vote
IWDC
2001
Springer
16 years 3 days ago
2001
Springer
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...