51 search results - page 6 / 11 » Treelike Comparability Graphs: Characterization, Recognition... |
152
click to vote
ICIAP
2001
Springer
16 years 6 months ago
2001
Springer
We propose a novel representation for characterizing image differences using a deformable technique for obtaining pixel-wise correspondences. This representation, which is based o...
168
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
A directed agent implies an agent with high constraints in both recognition and motion. Because of the embodied restrictions, the directed agent perceives a sense of subjective di...
149
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
193
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
161
click to vote
SAC
2009
ACM
16 years 19 days ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...