MergeShuffle: a very fast, parallel random permutation algorithm.
Axel BacherOlivier BodiniAlexandros HollenderJérémie O. LumbrosoPublished in: GASCom (2018)
Keyphrases
- learning algorithm
- preprocessing
- single pass
- cost function
- worst case
- computational cost
- convergence rate
- detection algorithm
- optimization algorithm
- computationally efficient
- expectation maximization
- experimental evaluation
- np hard
- computational complexity
- optimal solution
- randomly generated
- recognition algorithm
- parallel processing
- parallel implementation
- sorting algorithms
- similarity measure
- matching algorithm
- linear programming
- memory requirements
- input data
- dynamic programming
- multi objective
- significant improvement
- parallel version
- k means