Sciweavers

829 search results - page 162 / 166
» Distance domination-critical graphs
Sort
View
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
TROB
2008
168views more  TROB 2008»
14 years 9 months ago
A Minimalistic Approach to Appearance-Based Visual SLAM
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...
Henrik Andreasson, Tom Duckett, Achim J. Lilientha...
TROB
2008
118views more  TROB 2008»
14 years 9 months ago
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
COMBINATORICS
2004
115views more  COMBINATORICS 2004»
14 years 9 months ago
Dense Packings of Equal Spheres in a Cube
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
Thierry Gensane
CIKM
2007
Springer
15 years 1 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang