Sciweavers

420 search results - page 8 / 84
» Discrete mobile centers
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
CONTEXT
2003
Springer
14 years 21 days ago
Unpacking Meaning from Words: A Context-Centered Approach to Computational Lexicon Design
Abstract. The knowledge representation tradition in computational lexicon design represents words as static encapsulations of purely lexical knowledge. We suggest that this view po...
Hugo Liu
IPSN
2004
Springer
14 years 25 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
JGTOOLS
2008
53views more  JGTOOLS 2008»
13 years 7 months ago
Query Sphere Indexing for Neighborhood Requests
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
Nicolas Brodu
DGCI
2006
Springer
13 years 11 months ago
Exact Euclidean Medial Axis in Higher Resolution
Abstract. The notion of skeleton plays a major role in shape analysis. Some usually desirable characteristics of a skeleton are: sufficient for the reconstruction of the original o...
André Vital Saúde, Michel Couprie, R...