Exhaustive Search for Snake-in-the-Box Codes.
Patric R. J. ÖstergårdVille H. PetterssonPublished in: Graphs Comb. (2015)
Keyphrases
- exhaustive search
- dynamic programming
- active contours
- brute force
- search space
- nearest neighbor search
- solution space
- search methods
- error correction
- active contour model
- computational complexity
- computationally feasible
- b spline
- simulated annealing
- optimal solution
- error correcting codes
- segmentation method
- energy function
- markov random field
- control points
- lower bound
- data points
- special case
- minimum bounding