2899 search results - page 275 / 580 » Dynamic Trees in Practice |
139
click to vote
NETWORKING
2007
15 years 5 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
119
click to vote
ALENEX
2003
15 years 5 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
157
click to vote
VMV
2001
15 years 5 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
151
click to vote
WSCG
2004
15 years 5 months ago
2004
This paper presents an interactive environment for texturing surfaces of arbitrary 3D objects. By uniquely using solid textures and applying them to the surface, we do not require...
136
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...