Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
Gianni Franceschini, S. Muthukrishnan, Mihai Patra...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...