Sciweavers

87 search results - page 12 / 18
» Dynamic Maximum Tree Depth
Sort
View
ECAI
2010
Springer
13 years 10 months ago
Variable Level-Of-Detail Motion Planning in Environments with Poorly Predictable Bodies
Motion planning in dynamic environments consists of the generation of a collision-free trajectory from an initial to a goal state. When the environment contains uncertainty, preven...
Stefan Zickler, Manuela M. Veloso
PC
2007
123views Management» more  PC 2007»
13 years 9 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
CACM
1998
110views more  CACM 1998»
13 years 9 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
VISUALIZATION
1996
IEEE
14 years 1 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler