Sciweavers

1511 search results - page 192 / 303
» Randomness, lowness and degrees
Sort
View
ISCAPDCS
2004
15 years 7 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
SBBD
2004
128views Database» more  SBBD 2004»
15 years 7 months ago
Integrating Heterogeneous Data Sources in Flexible and Dynamic Environments
Flexible and dynamic environments are characterized by high independence from connection participants, low control over available services and high tolerance to communication fail...
Angelo Brayner, Marcelo Meirelles
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
15 years 7 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
WSCG
2003
123views more  WSCG 2003»
15 years 7 months ago
From Dupin Cyclides to Scaled Cyclides
Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. They have a low algebraic degree and have been propo...
Lionel Garnier, Sebti Foufou, Marc Neveu
CCGRID
2010
IEEE
15 years 7 months ago
Selective Recovery from Failures in a Task Parallel Programming Model
Abstract--We present a fault tolerant task pool execution environment that is capable of performing fine-grain selective restart using a lightweight, distributed task completion tr...
James Dinan, Arjun Singri, P. Sadayappan, Sriram K...