An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Leonid KhachiyanEndre BorosKhaled M. ElbassioniVladimir GurvichPublished in: Discret. Appl. Math. (2006)
Keyphrases
- experimental evaluation
- cost function
- polynomially bounded
- generation algorithm
- segmentation algorithm
- parallel implementation
- computationally efficient
- computational complexity
- dynamic programming
- significant improvement
- learning algorithm
- np hard
- detection algorithm
- expectation maximization
- probabilistic model
- preprocessing
- search space
- high accuracy
- clustering method
- input data
- optimal solution
- similarity measure
- generation process
- convergence rate
- worst case
- hardware implementation
- classification algorithm
- tree structure
- optimization algorithm
- theoretical analysis
- simulated annealing
- higher order
- data sets
- k means
- pairwise
- objective function
- image sequences
- decision trees
- neural network