2100 search results - page 161 / 420 » Learning to rank on graphs |
163
click to vote
INFOVIS
2005
IEEE
16 years 2 days ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
175
click to vote
ICML
2007
IEEE
16 years 7 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'...
164
click to vote
JETAI
1998
15 years 6 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...
208
click to vote
PKDD
2010
Springer
15 years 4 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...
211
click to vote
TIP
2010
15 years 4 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...