Sciweavers

2056 search results - page 250 / 412
» time 2000
Sort
View
TMC
2008
91views more  TMC 2008»
15 years 6 months ago
Dynamic Forwarding over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
Kai-Wei Fan, Sha Liu, Prasun Sinha
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
15 years 6 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
CGF
2000
158views more  CGF 2000»
15 years 6 months ago
Unsteady Flow Visualization by Animating Evenly-Spaced Streamlines
In recent years the work on vector field visualization has been concentrated on LIC-based methods. In this paper we propose an alternative solution for the visualization of unstea...
Bruno Jobard, Wilfrid Lefer
CGF
2000
127views more  CGF 2000»
15 years 6 months ago
Interactive High-Quality Maximum Intensity Projection
Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high-intensity structures within volumetric data. At each pixel the highest data valu...
Lukas Mroz, Helwig Hauser, Eduard Gröller
CN
2000
126views more  CN 2000»
15 years 6 months ago
Cartesian routing
The dominant backbone protocol implemented in the Internet is the Border Gateway Protocol (BGP). Each router implementing BGP maintains a routing table. As networks increase in si...
Larry Hughes, Omid Banyasad, Evan J. Hughes