3637 search results - page 53 / 728 » On Dynamic Bit-Probe Complexity |
WG
2005
Springer
14 years 2 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
CSCWD
2001
Springer
14 years 1 months ago
2001
Springer
Collaborative design is challenging because strong interdependencies between design issues make it difficult to converge on a single design that satisfies these dependencies and i...
CG
2004
Springer
13 years 9 months ago
2004
Springer
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
TVCG
2010
13 years 7 months ago
2010
— We present a visualization technique for simulated fluid dynamics data that visualizes the gradient of the velocity field in an intuitive way. Our work is inspired by rheosco...