Fast <it>k</it>-selection algorithms for graphics processing units
From MaRDI portal
Publication:5406279
DOI10.1145/2133803.2345676zbMath1284.68637OpenAlexW2058942559MaRDI QIDQ5406279
Russel Steinbach, Tolu Alabi, Bradley Gordon, Jeffrey D. Blanchard
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2133803.2345676
Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Inference, learning and attention mechanisms that exploit and preserve sparsity in CNNs ⋮ GPU accelerated greedy algorithms for compressed sensing ⋮ ggks
Uses Software
This page was built for publication: Fast <it>k</it>-selection algorithms for graphics processing units