An O(n log n) algorithm for 1-D tile compaction.
Richard AndersonSimon KahanMartine D. F. SchlagPublished in: ICCAD (1989)
Keyphrases
- experimental evaluation
- worst case
- improved algorithm
- segmentation algorithm
- preprocessing
- computational cost
- dynamic programming
- np hard
- cost function
- matching algorithm
- search space
- learning algorithm
- detection algorithm
- significant improvement
- k means
- objective function
- single pass
- neural network
- times faster
- optimization algorithm
- theoretical analysis
- computationally efficient
- linear programming
- high accuracy
- lower bound
- expectation maximization
- simulated annealing
- similarity measure
- decision trees
- convex hull
- convergence rate
- multiresolution
- multi objective