895 search results - page 44 / 179 » Using graphs for some discrete tomography problems |
ICIP
2010
IEEE
13 years 9 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
NIPS
2008
14 years 10 days ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
ANOR
2004
13 years 10 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
FCT
2007
Springer
14 years 21 days ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...