The optimal LLL algorithm is still polynomial in fixed dimension.
Ali AkhaviPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- optimal solution
- dynamic programming
- learning algorithm
- preprocessing
- computational complexity
- polynomially bounded
- exhaustive search
- objective function
- optimization algorithm
- worst case
- cost function
- fixed size
- detection algorithm
- matching algorithm
- np hard
- search space
- linear programming
- segmentation algorithm
- significant improvement
- globally optimal
- improved algorithm
- k means
- path planning
- dimensional data
- optimal path
- space complexity
- recognition algorithm
- closed form
- expectation maximization
- high accuracy
- probabilistic model