686 search results - page 85 / 138 » Packing Cycles in Graphs |
120
click to vote
ECOOP
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
123
Voted
PAMI
2002
15 years 8 days ago
2002
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
104
click to vote
TIT
2008
15 years 15 days ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
108
click to vote
TSP
2008
15 years 15 days ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
110
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...