4171 search results - page 152 / 835 » Choice numbers of graphs |
379
click to vote
PAMI
2010
15 years 5 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...
148
click to vote
IJCAI
2007
15 years 8 months ago
2007
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
165
click to vote
EUROIMSA
2006
15 years 8 months ago
2006
The repeated pattern of I, P and B frames in an MPEG stream is known as the Group of Pictures (GOP). Current GOP choices are made using intuition and informal guidelines without t...
141
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...
131
click to vote
FOCS
2007
IEEE
16 years 27 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 ...