Bottom-Up: a New Algorithm to Generate Random Linear Extensions of a Poset.
Pedro García-SegadorPedro MirandaPublished in: Order (2019)
Keyphrases
- experimental evaluation
- times faster
- computational complexity
- dynamic programming
- learning algorithm
- matching algorithm
- high accuracy
- worst case
- computational cost
- cost function
- linear complexity
- randomly generated
- recognition algorithm
- detection algorithm
- objective function
- k means
- significant improvement
- simulated annealing
- piecewise linear
- np hard
- theoretical analysis
- improved algorithm
- preprocessing
- face recognition
- partial order
- neural network
- closed form
- tree structure
- evolutionary algorithm
- expectation maximization
- particle swarm optimization
- feature space