80 search results - page 1 / 16 » Data reduction and exact algorithms for clique cover |
JEA
2008
13 years 11 months ago
2008
COCOON
2005
Springer
14 years 26 days ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
SIAMJO
2010
13 years 5 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
TC
2010
13 years 9 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...