Sciweavers

49 search results - page 6 / 10
» Projective Nonnegative Graph Embedding
Sort
View
COMGEO
2004
ACM
13 years 7 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 9 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki
AGTIVE
2003
Springer
14 years 21 days ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 2 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
FOCS
2005
IEEE
14 years 1 months ago
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Ked...