181 search results - page 16 / 37 » Graph Embedding: A General Framework for Dimensionality Redu... |
160
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
282
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: Discovering the genetic basis of common genetic diseases in the human genome represents a public health issue. However, the dimensionality of the genetic data (up to 1...
170
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
176
click to vote
AMFG
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we propose the concept of Manifold of Facial Expression based on the observation that images of a subject’s facial expressions define a smooth manifold in the hig...
138
click to vote
SIAMJO
2010
14 years 11 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...