Sciweavers

260 search results - page 20 / 52
» Dynamic Random Geometric Graphs
Sort
View
HYBRID
2007
Springer
15 years 1 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
WIOPT
2006
IEEE
15 years 3 months ago
Color-based broadcasting for ad hoc networks
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CVPR
2004
IEEE
15 years 1 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 3 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner