Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm.
Hervé BrönnimannLutz KettnerMichel PocchiolaJack SnoeyinkPublished in: ALENEX/ANALCO (2005)
Keyphrases
- dynamic programming
- improved algorithm
- times faster
- detection algorithm
- experimental evaluation
- high accuracy
- objective function
- k means
- computational cost
- matching algorithm
- segmentation algorithm
- theoretical analysis
- expectation maximization
- recognition algorithm
- preprocessing
- optimal solution
- greedy algorithms
- estimation algorithm
- knapsack problem
- neural network
- classification algorithm
- upper bound
- cost function
- search space
- learning algorithm