34 search results - page 3 / 7 » Linear-Space Algorithms for Distance Preserving Embedding |
ICALP
2001
Springer
14 years 28 days ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
The foremost nonlinear dimensionality reduction algorithms provide an embedding only for the given training data, with no straightforward extension for test points. This shortcomin...
TSMC
2010
13 years 3 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
MICCAI
2006
Springer
14 years 9 months ago
2006
Springer
The concept of the Logarithm of the Odds (LogOdds) is frequently used in areas such as artificial neural networks, economics, and biology. Here, we utilize LogOdds for a shape repr...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...