2283 search results - page 134 / 457 » Bounds of Graph Characteristics |
DAM
2010
13 years 8 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
User-provided object bounding box is a simple and
popular interaction paradigm considered by many existing
interactive image segmentation frameworks. However,
these frameworks t...
ESA
1994
Springer
14 years 6 days ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
NIPS
2008
13 years 9 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
ATAL
2006
Springer
13 years 12 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...