Sciweavers

116 search results - page 11 / 24
» A practical access to the theory of parallel algorithms
Sort
View
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
MM
2010
ACM
203views Multimedia» more  MM 2010»
13 years 7 months ago
Processing web-scale multimedia data
The Internet brings us access to multimedia databases with billions of data instances. The massive amount of data available to researchers and application developers brings both o...
Malcolm Slaney, Edward Y. Chang
ICS
2009
Tsinghua U.
14 years 2 months ago
Fast and scalable list ranking on the GPU
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...
M. Suhail Rehman, Kishore Kothapalli, P. J. Naraya...
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 24 days ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel
SC
2000
ACM
13 years 11 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout