2283 search results - page 197 / 457 » Bounds of Graph Characteristics |
119
click to vote
AMS
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new approach for incremental 3D SLAM from segmented range images with unknown feature association. For feature and motion tracking, an any-time interpretation...
100
Voted
DCOSS
2005
Springer
15 years 9 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
132
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
128
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
109
click to vote
GD
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...