An algorithm to generate exactly once every tiling with lozenges of a domain.
Sébastien DesreuxPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- learning algorithm
- computational complexity
- times faster
- experimental evaluation
- optimal solution
- optimization algorithm
- worst case
- dynamic programming
- improved algorithm
- selection algorithm
- recognition algorithm
- simulated annealing
- high accuracy
- cost function
- computational cost
- similarity measure
- objective function
- classification algorithm
- search space
- theoretical analysis
- k means
- significant improvement
- np hard
- input data
- expectation maximization
- graph cuts
- segmentation algorithm
- domain specific
- clustering method
- matching algorithm
- preprocessing
- memory requirements
- probabilistic model
- neural network