Sciweavers

867 search results - page 81 / 174
» Network Robustness and Graph Topology
Sort
View
IROS
2007
IEEE
125views Robotics» more  IROS 2007»
14 years 2 months ago
Hybrid localization using the hierarchical atlas
— This paper presents a hybrid localization scheme for a mobile robot using the hierarchical atlas. The hierarchical atlas is a map that consists of a higher level topological gr...
Stephen Tully, Hyungpil Moon, Deryck Morales, Geor...
ICMS
2010
13 years 6 months ago
TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
Jan Reininghaus, David Günther, Ingrid Hotz, ...
ADHOCNOW
2004
Springer
14 years 1 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
INFOCOM
2009
IEEE
14 years 2 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
ISCAPDCS
2007
13 years 9 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng