Work-Time Optimal K-Merge Algorithms on the PRAM.
Tatsuya HayashiKoji NakanoStephan OlariuPublished in: IPPS (1997)
Keyphrases
- worst case
- learning algorithm
- exhaustive search
- times faster
- data structure
- dynamic programming
- computational cost
- data mining
- graph theory
- orders of magnitude
- computationally expensive
- optimization problems
- approximately optimal
- binary search trees
- parallel algorithm
- machine learning algorithms
- computational complexity
- image sequences
- machine learning