Sciweavers

1100 search results - page 188 / 220
» Approximate distance oracles
Sort
View
127
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 3 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler
133
Voted
DKE
2006
125views more  DKE 2006»
15 years 3 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
100
Voted
FMSD
2006
103views more  FMSD 2006»
15 years 3 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
136
Voted
IJRR
2008
115views more  IJRR 2008»
15 years 3 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
141
Voted
JGTOOLS
2006
111views more  JGTOOLS 2006»
15 years 3 months ago
Stochastic Billboard Clouds for Interactive Foliage Rendering
We render tree foliage levels of detail (LODs) using a new adaptation of billboard clouds. Our contributions are a simple and efficient billboard cloud creation algorithm designed...
J. Dylan Lacewell, David Edwards, Peter Shirley, W...