1729 search results - page 146 / 346 » On Bounds for the k-Partitioning of Graphs |
151
click to vote
ICCV
2009
IEEE
16 years 11 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...
156
click to vote
ESA
1994
Springer
15 years 10 months 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...
176
click to vote
NIPS
2008
15 years 7 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 ...
162
click to vote
ATAL
2006
Springer
15 years 10 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...
175
click to vote
IJCAI
2007
15 years 7 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...