874 search results - page 97 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
VLDB
1993
ACM
14 years 1 months ago
1993
ACM
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
FOCS
1994
IEEE
14 years 1 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
JMLR
2010
13 years 3 months ago
2010
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
TPDS
1998
13 years 8 months ago
1998
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...