2695 search results - page 149 / 539 » Learning Graph Matching |
126
click to vote
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
123
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
165
click to vote
ML
2000
ACM
15 years 2 months ago
2000
ACM
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
121
click to vote
JETAI
1998
15 years 2 months ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
145
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...