195 search results - page 26 / 39 » A Riemannian approach to graph embedding |
IJON
2010
13 years 5 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...
GD
2001
Springer
14 years 6 days ago
2001
Springer
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
FSTTCS
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
ALGOSENSORS
2004
Springer
14 years 1 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...