Sciweavers

45 search results - page 6 / 9
» Parallel I O in Bulk-Synchronous Parallel ML
Sort
View
IJCAI
1989
13 years 8 months ago
A Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
Andrew B. Baker, Matthew L. Ginsberg
ICASSP
2008
IEEE
14 years 1 months ago
Implementation of message-passing algorithms for the acquisition of spreading codes
A new technique to acquire pseudo-noise (PN) sequences has been recently proposed in [1] and [2]. It is based on the paradigm of iterative Message Passing (iMP) to be run on loopy...
Massimo Rovini, Fabio Principe, Luca Fanucci, Marc...
ICPP
1992
IEEE
13 years 11 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
SOFSEM
2012
Springer
12 years 2 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad