5115 search results - page 509 / 1023 » On Randomized Lanczos Algorithms |
194
click to vote
PODC
2003
ACM
16 years 3 days ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
193
Voted
SI3D
2003
ACM
16 years 3 days ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
169
click to vote
SPAA
2003
ACM
16 years 3 days ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
180
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
180
Voted
HCW
1998
IEEE
15 years 11 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...