Sciweavers

12194 search results - page 2066 / 2439
» Numberings Optimal for Learning
Sort
View
IPSN
2007
Springer
16 years 1 months 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
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ISPA
2007
Springer
16 years 1 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
LOCA
2007
Springer
16 years 29 days ago
Localizing Tags Using Mobile Infrastructure
This paper presents algorithms, simulations, and empirical results of a system that finds relative tag positions in 3D space using a new approach called “mobile infrastructure....
Ying Zhang, Kurt Partridge, Jim Reich
NPC
2007
Springer
16 years 29 days ago
Performance Prediction for Mappings of Distributed Applications on PC Clusters
Abstract. Distributed applications running on clusters may be composed of several components with very different performance requirements. The FlowVR middleware allows the develop...
Sylvain Jubertie, Emmanuel Melin
« Prev « First page 2066 / 2439 Last » Next »