Sciweavers

2814 search results - page 108 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
INFOCOM
2008
IEEE
15 years 8 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
CAIP
1995
Springer
155views Image Analysis» more  CAIP 1995»
15 years 6 months ago
A Proposal for the Implementation of a Parallel Watershed Algorithm
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
Arnold Meijster, Jos B. T. M. Roerdink
DAC
2000
ACM
15 years 6 months ago
Passive model order reduction of multiport distributed interconnects
Signal integrity analysis has become imperative for high-speed designs. In this paper, we present a new technique to advance Krylov-space based passive model-reduction algorithms ...
Emad Gad, Anestis Dounavis, Michel S. Nakhla, Rama...
95
Voted
IPPS
2002
IEEE
15 years 7 months ago
TCS: Estimating Gene Genealogies
Phylogentic analysis is becoming an increasingly important tool for customized drug treatments, epidemiological studies, and evolutionary analysis. The TCS method provides an impo...
Mark J. Clement, Quinn Snell, Peter Walker, David ...
CP
1999
Springer
15 years 6 months ago
Optimal Distributed Arc-Consistency
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
Youssef Hamadi