2084 search results - page 175 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
162
Voted
CBMS
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents the developement of a novel, fullyautomatic tracking and segmentation system to extract the boundary of the carotid artery from ultrasound images in real-time....
149
click to vote
ICDCS
2008
IEEE
15 years 11 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
162
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
146
click to vote
PVM
1999
Springer
15 years 9 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
147
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...