1729 search results - page 193 / 346 » On Bounds for the k-Partitioning of Graphs |
178
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
185
click to vote
CCCG
2009
15 years 7 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
159
click to vote
AMS
2005
Springer
15 years 12 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...
138
click to vote
DCOSS
2005
Springer
15 years 12 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...
163
click to vote
IPPS
1999
IEEE
15 years 10 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...