3757 search results - page 160 / 752 » The overlap number of a graph |
187
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
378
click to vote
PAMI
2010
15 years 4 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
137
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
129
click to vote
FOCS
2007
IEEE
16 years 22 days ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
165
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...