21007 search results - page 268 / 4202 » Mobile Parallel Computing |
164
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
167
click to vote
PC
2000
15 years 6 months ago
2000
The Computational Plant (Cplant) project at Sandia National Laboratories is developing a large-scale, massively parallel computing resource from a cluster of commodity computing a...
147
click to vote
PPSC
1997
15 years 8 months ago
1997
We present an overview of algorithms and data structures for dynamic re nement coarsening adaptation of unstructured FE meshes on loosely coupled parallel processors. We describ...
215
click to vote
SBACPAD
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
185
Voted
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper describes a software architecture that allows image processing researchers to develop parallel applications in a transparent manner. The architecture’s main ...