Two techniques for reconciling algorithm parallelism with memory constraints.
Uzi VishkinPublished in: SPAA (2002)
Keyphrases
- high accuracy
- memory usage
- improved algorithm
- detection algorithm
- experimental evaluation
- np hard
- memory requirements
- matching algorithm
- optimization algorithm
- simulated annealing
- dynamic programming
- learning algorithm
- computational cost
- preprocessing
- times faster
- search space
- constrained optimization
- geometric constraints
- computational complexity
- recognition algorithm
- objective function
- parallel computation
- lower and upper bounds
- parallel implementation
- memory space
- associative memory
- tree structure
- clustering method
- segmentation algorithm
- theoretical analysis
- computationally efficient
- expectation maximization
- cost function
- k means
- optimal solution