Sciweavers

7648 search results - page 1038 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
IPSN
2007
Springer
16 years 8 days ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
170
Voted
ICNP
2005
IEEE
15 years 11 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
HPCC
2010
Springer
15 years 7 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
190
Voted
ICML
2000
IEEE
16 years 7 months ago
On-line Learning for Humanoid Robot Systems
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...
Gaurav Tevatia, Jörg Conradt, Sethu Vijayakum...
VIS
2008
IEEE
134views Visualization» more  VIS 2008»
16 years 7 months ago
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality
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...
Attila Gyulassy, Peer-Timo Bremer, Bernd Hamann,...
« Prev « First page 1038 / 1530 Last » Next »