A wide-range algorithm for minimal triangulation from an arbitrary ordering.
Anne BerryJean Paul BordatPinar HeggernesGeneviève SimonetYngve VillangerPublished in: J. Algorithms (2006)
Keyphrases
- wide range
- dynamic programming
- preprocessing
- estimation algorithm
- learning algorithm
- optimization algorithm
- detection algorithm
- np hard
- cost function
- k means
- times faster
- experimental evaluation
- computational cost
- classification algorithm
- theoretical analysis
- matching algorithm
- improved algorithm
- probabilistic model
- computational complexity
- optimal solution
- objective function
- particle swarm optimization
- maximum likelihood
- data sets
- feature space
- range data
- recognition algorithm
- selection algorithm
- arbitrary length