49 search results - page 7 / 10 » Projective Nonnegative Graph Embedding |
BMCBI
2006
13 years 7 months ago
2006
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In video surveillance, the sizes of face images are very small. However, few works have been done to investigate scalerobust face recognition. Our experiments on appearancebased m...
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
IJON
2010
13 years 4 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
DCG
2007
13 years 7 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...