A Randomised Approximation Algorithm for the Hitting Set Problem.
Mourad El OualiHelena FohlinAnand SrivastavPublished in: WALCOM (2013)
Keyphrases
- optimal solution
- input data
- significant improvement
- error bounds
- solution space
- search space
- k means
- learning algorithm
- matching algorithm
- segmentation algorithm
- initial set
- decomposition algorithm
- experimental evaluation
- cost function
- preprocessing
- computational complexity
- randomized algorithm
- computational cost
- bayesian networks
- lower and upper bounds
- error tolerance
- neural network
- times faster
- sufficient statistics
- tree structure
- ant colony optimization
- np complete
- particle swarm optimization
- feature set
- worst case
- probabilistic model
- np hard
- video sequences
- similarity measure