3008 search results - page 180 / 602 » Independence in connected graphs |
176
click to vote
ICCV
2007
IEEE
16 years 26 days ago
2007
IEEE
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
182
click to vote
PCM
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...
169
click to vote
IADIS
2004
15 years 8 months ago
2004
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
180
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
199
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...