On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Paliath NarendranAndrew M. MarshallBibhu MahapatraPublished in: UNIF (2010)
Keyphrases
- computational complexity
- dynamic programming
- space complexity
- learning algorithm
- np hard
- worst case
- optimal solution
- preprocessing
- cost function
- detection algorithm
- improved algorithm
- times faster
- matching algorithm
- convergence rate
- experimental evaluation
- significant improvement
- single pass
- estimation algorithm
- graph cuts
- computationally efficient
- segmentation algorithm
- objective function
- high computational complexity
- data sets
- lower complexity
- memory requirements
- clustering method
- input data
- linear programming
- simulated annealing
- high accuracy
- probabilistic model
- computational cost