An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings.
Takafumi ShibutaShinichi TajimaPublished in: J. Symb. Comput. (2020)
Keyphrases
- computational cost
- learning algorithm
- dynamic programming
- cost function
- preprocessing
- worst case
- high accuracy
- times faster
- experimental evaluation
- np hard
- convergence rate
- matching algorithm
- optimization algorithm
- multi dimensional
- simulated annealing
- input data
- computational efficiency
- k means
- selection algorithm
- optimal solution
- objective function
- estimation algorithm
- efficient computation
- data sets
- detection algorithm
- hilbert curve
- theoretical analysis
- computationally efficient
- expectation maximization
- particle swarm optimization
- probabilistic model
- significant improvement
- search space
- similarity measure
- genetic algorithm
- neural network