Sciweavers

549 search results - page 12 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
SCVMA
2004
Springer
15 years 2 months ago
Comparison of Edge-Driven Algorithms for Model-Based Motion Estimation
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
Hendrik Dahlkamp, Artur Ottlik, Hans-Hellmut Nagel
ICN
2005
Springer
15 years 3 months ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
ACTA
2005
104views more  ACTA 2005»
14 years 9 months ago
Optimal recovery schemes in fault tolerant distributed computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
Kamilla Klonowska, Håkan Lennerstad, Lars Lu...
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 9 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
15 years 3 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...