Sciweavers

4926 search results - page 340 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
IPPS
2008
IEEE
16 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
COMPGEOM
2004
ACM
16 years 5 days ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
STACS
2010
Springer
16 years 1 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
16 years 23 days ago
Distributed Diagnosis of Coupled Mobile Robots
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...
CN
2008
126views more  CN 2008»
15 years 6 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani