Parallel probabilistic searching and sortin algorithms.
Ivan KramosilPublished in: Kybernetika (1990)
Keyphrases
- times faster
- data structure
- computational cost
- probabilistic model
- worst case
- optimization problems
- orders of magnitude
- computationally expensive
- recently developed
- exact and approximate
- parallel hardware
- information retrieval
- parallel implementations
- depth first search
- parallel machines
- efficient implementation
- theoretical analysis
- significant improvement
- computer vision
- search engine