Results 11  20
of
767
Robust Distributed Network Localization with Noisy Range Measurements
, 2004
"... This paper describes a distributed, lineartime algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherw ..."
Abstract

Cited by 403 (20 self)
 Add to MetaCart
that otherwise corrupt localization computations. We formulate the localization problem as a twodimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable
Intelligent Scissors for Image Composition
 In Computer Graphics, SIGGRAPH Proceedings
, 1995
"... We present a new, interactive tool called Intelligent Scissors which we use for image segmentation and composition. Fully automated segmentation is an unsolved problem, while manual tracing is inaccurate and laboriously unacceptable. However, Intelligent Scissors allow objects within digital images ..."
Abstract

Cited by 291 (7 self)
 Add to MetaCart
dimensional graph searching problem. DP provides mathematically optimal boundaries while greatly reducing sensitivity to local noise or other intervening structures. Robustness is further enhanced with onthefly training which causes the boundary to adhere to the specific type of edge currently being followed
Graphs as rotations
 KAM Series, 96327, Prague,1996
"... Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects, that coincides ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects
Embedding of cycles in rotator and . . .
"... Symmetric directed Cayley graphs called rotator graphs have been proposed recently in the literature. In addition to a lower diameter and average distance compared to the star graph, hypercube, and kary ncubes, these rotator graphs also have a rich cyclic structure. We identify ..."
Abstract
 Add to MetaCart
Symmetric directed Cayley graphs called rotator graphs have been proposed recently in the literature. In addition to a lower diameter and average distance compared to the star graph, hypercube, and kary ncubes, these rotator graphs also have a rich cyclic structure. We identify
Complete Rotations in Cayley Graphs
, 2000
"... As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underl ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties
Cayley Graphs with Complete Rotations
, 1999
"... As it is introduced by Bermond, P#rennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the under ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
As it is introduced by Bermond, P#rennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties
The Rotational Dimension of a Graph
, 2008
"... Given a connected graph G = (N, E) with node weights s ∈ R N + and nonnegative edge lengths, we study the following embedding problem related to an eigenvalue optimization problem over the second smallest eigenvalue of the (scaled) Laplacian of G: Find vi ∈ R N , i ∈ N so that distances between ad ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
that are linked by massless cables of given lengths. We define the rotational dimension of G to be the minimal dimension k so that for all choices of lengths and weights an optimal solution can be found in R k and show that this is a minor monotone graph parameter. We give forbidden minor characterizations up
A fast adaptive layout algorithm for undirected graphs
, 1995
"... Abstract. We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the springembedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations and oscilla ..."
Abstract

Cited by 133 (1 self)
 Add to MetaCart
Abstract. We present a randomized adaptive layout algorithm for nicely drawing undirected graphs that is based on the springembedder paradigm and contains several new heuristics to improve the convergence, including local temperatures, gravitational forces and the detection of rotations
GraphChi: Largescale Graph Computation On just a PC
 In Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation, OSDI’12
, 2012
"... Current systems for graph computation require a distributed computing cluster to handle very large realworld problems, such as analysis on social networks or the web graph. While distributed computational resources have become more accessible, developing distributed graph algorithms still remains c ..."
Abstract

Cited by 115 (6 self)
 Add to MetaCart
per second, while simultaneously performing computation. We show, through experiments and theoretical analysis, that GraphChi performs well on both SSDs and rotational hard drives. By repeating experiments reported for existing distributed systems, we show that, with only fraction of the resources
Results 11  20
of
767