6897 search results - page 622 / 1380 » Parallelization of Modular Algorithms |
155
Voted
SODA
1996
ACM
15 years 8 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
147
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
164
click to vote
CN
1999
15 years 6 months ago
1999
We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was develop...
181
Voted
TMI
2010
15 years 5 months ago
2010
Abstract—Cardiac computed tomography (CT) has been improved over past years, but it still needs improvement for higher temporal resolution in the cases of high or irregular cardi...
211
click to vote
ISPDC
2005
IEEE
16 years 7 days ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...