Breadth-first numbering: lessons from a small exercise in algorithm design.
Chris OkasakiPublished in: ICFP (2000)
Keyphrases
- dynamic programming
- experimental evaluation
- learning algorithm
- computational cost
- preprocessing
- particle swarm optimization
- improved algorithm
- matching algorithm
- segmentation algorithm
- neural network
- search space
- search strategy
- k means
- significant improvement
- cost function
- worst case
- selection algorithm
- convex hull
- similarity measure
- theoretical analysis
- computational complexity
- times faster
- objective function
- hardware implementation
- single pass
- recognition algorithm
- clustering method
- detection algorithm
- optimization algorithm
- maximum likelihood
- input data
- linear programming
- high accuracy
- search algorithm
- image segmentation
- case study