A "Divide and Conquer" Algorithm for Hilbert-Poincaré Series, Multiplicity and Dimension of Monomial Ideals.
Anna Maria BigattiPasqualina ContiLorenzo RobbianoCarlo TraversoPublished in: AAECC (1993)
Keyphrases
- learning algorithm
- cost function
- times faster
- computational cost
- improved algorithm
- detection algorithm
- segmentation algorithm
- experimental evaluation
- worst case
- particle swarm optimization
- linear programming
- dynamic programming
- high accuracy
- objective function
- search space
- preprocessing
- optimization algorithm
- computational complexity
- dimensional data
- similarity measure
- recognition algorithm
- matching algorithm
- clustering method
- theoretical analysis
- computationally efficient
- significant improvement
- data sets
- denoising
- np hard