Sciweavers

813 search results - page 142 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 1 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 10 days ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
CVPR
2003
IEEE
14 years 9 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
GIS
2008
ACM
14 years 8 months ago
Editing and versioning dynamic network models
Network data models are widely used to describe the connectivity between spatial features in GIS architectures. Recent applications demand that such models are editable in multius...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...