Sciweavers

161 search results - page 5 / 33
» Setting port numbers for fast graph exploration
Sort
View
ARSCOM
2005
94views more  ARSCOM 2005»
13 years 7 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin
COMPGEOM
2004
ACM
14 years 1 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
14 years 1 months ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
14 years 1 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
ASUNAM
2011
IEEE
12 years 7 months ago
MultiAspectForensics: Pattern Mining on Large-Scale Heterogeneous Networks with Tensor Analysis
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
Koji Maruhashi, Fan Guo, Christos Faloutsos