139 search results - page 1 / 28 » Sparse Projections over Graph |
AAAI
2008
13 years 6 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
ESA
2009
Springer
13 years 10 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Random projection methods give distributions over k
GBRPR
2009
Springer
13 years 10 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...