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...
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 ...
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...
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....
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...