712 search results - page 103 / 143 » On Spectral Graph Drawing |
ICML
2007
IEEE
14 years 9 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'...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
GD
2006
Springer
14 years 18 days ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...