Sciweavers

735 search results - page 34 / 147
» Supervised Graph Inference
Sort
View
4OR
2004
84views more  4OR 2004»
13 years 7 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
CVPR
2009
IEEE
15 years 2 months ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 3 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
CVPR
2004
IEEE
14 years 9 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
IJCAI
2007
13 years 9 months ago
A Factor Graph Model for Software Bug Finding
Automatic tools for finding software errors require knowledge of the rules a program must obey, or “specifications,” before they can identify bugs. We present a method that ...
Ted Kremenek, Andrew Y. Ng, Dawson R. Engler