691 search results - page 46 / 139 » Non-negative graph embedding |
GBRPR
2009
Springer
14 years 2 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...
ICPR
2010
IEEE
14 years 21 days ago
2010
IEEE
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
COMBINATORICS
2002
13 years 7 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
NIPS
2008
13 years 9 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
SIAMCOMP
2008
13 years 7 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...