Sciweavers

704 search results - page 8 / 141
» Isometrically Embedded Graphs
Sort
View
IPL
2010
115views more  IPL 2010»
13 years 6 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 9 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
ICML
2006
IEEE
14 years 8 months ago
Semi-supervised nonlinear dimensionality reduction
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
Xin Yang, Haoying Fu, Hongyuan Zha, Jesse L. Barlo...
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
14 years 1 months ago
Expression Compensation for Face Recognition Using a Polar Geodesic Representation
This paper addresses the problem of face recognition in the presence of deformation due to expressions. Facial motion is considered as an isometric mapping between surfaces, which...
Iordanis Mpiperis, Sotiris Malassiotis, Michael G....
NIPS
1997
13 years 9 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum