Sciweavers

511 search results - page 15 / 103
» The intrinsic dimensionality of graphs
Sort
View
CVPR
2005
IEEE
14 years 12 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ICMLA
2008
13 years 11 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 9 months ago
Support-Graph Preconditioners for 2-Dimensional Trusses
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...
Samuel I. Daitch, Daniel A. Spielman
GD
2000
Springer
14 years 1 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
ORDER
2006
97views more  ORDER 2006»
13 years 9 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood