324 search results - page 36 / 65 » Distance Approximating Trees: Complexity and Algorithms |
105
click to vote
VRST
1997
ACM
15 years 7 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
103
click to vote
PAKDD
2005
ACM
15 years 8 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
144
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
127
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
102
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...