62 search results - page 12 / 13 » Consistent Cycles in Graphs and Digraphs |
ENDM
2007
13 years 10 months ago
2007
Given a graph G = (V, E), let P be a partition of V . We say that P is dominating if, for each part P of P, the set V \ P is a dominating set in G (equivalently, if every vertex h...
ECCV
2004
Springer
15 years 22 days ago
2004
Springer
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
HCW
1999
IEEE
14 years 3 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
IJCAI
2007
14 years 8 days 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...