Implementing the Diverting Fast Radix Algorithm

07/28/2022
by   Stuart Thiel, et al.
0

This paper presents ThielSort, a practical implementation of the Diverting Fast Radix (DFR) Algorithm. The theoretical improvements over classical radix sorts are outlined and implementation details are specified to demonstrate that the algorithm is competitive with the state of the art. The effectiveness of this implementation of the DFR algorithm is shown by considering a variety of standard distributions of data and input sizes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2020

A Practical Algorithm for the Computation of the Genus

We describe a practical algorithm to compute the (oriented) genus of a g...
research
12/14/2018

Evaluation of an open-source implementation of the SRP-PHAT algorithm within the 2018 LOCATA challenge

This short paper presents an efficient, flexible implementation of the S...
research
06/13/2022

Lazy and Fast Greedy MAP Inference for Determinantal Point Process

The maximum a posteriori (MAP) inference for determinantal point process...
research
03/05/2018

Fast Implementation of a Bayesian Unsupervised Algorithm

In a recent paper, we have proposed an unsupervised algorithm for audio ...
research
03/05/2018

Fast Implementation of a Bayesian Unsupervised Segmentation Algorithm

In a recent paper, we have proposed an unsupervised algorithm for audio ...
research
09/03/2017

An Improved Algorithm for E-Generalization

E-generalization computes common generalizations of given ground terms w...
research
01/25/2019

Faster Boosting with Smaller Memory

The two state-of-the-art implementations of boosted trees: XGBoost and L...

Please sign up or login with your details

Forgot password? Click here to reset