Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
Mourad El OualiVolkmar SauerlandPublished in: CoRR (2013)
Keyphrases
- improved algorithm
- computational complexity
- dynamic programming
- np hard
- query complexity
- matching algorithm
- optimization algorithm
- learning algorithm
- randomized algorithm
- times faster
- cost function
- computational cost
- space complexity
- preprocessing
- constant factor
- particle swarm optimization
- expectation maximization
- detection algorithm
- polygonal approximation
- k means
- closed form
- search space
- database
- polynomial time approximation
- approximation ratio
- memory requirements
- error bounds
- query optimization
- web search engines
- probabilistic model
- similarity measure
- image segmentation
- information retrieval