1370 search results - page 121 / 274 » On grids in topological graphs |
221
click to vote
INFOCOM
2008
IEEE
16 years 25 days ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
217
click to vote
COMPGEOM
2010
ACM
15 years 11 months 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 ...
196
click to vote
VIS
2008
IEEE
16 years 7 months ago
2008
IEEE
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
136
click to vote
GRID
2005
Springer
15 years 12 months ago
2005
Springer
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
185
click to vote
SIGGRAPH
1996
ACM
15 years 10 months ago
1996
ACM
Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models. In this paper, we present an algorithm and syst...