Hardness and Approximation of High-Dimensional Search Problems (Invited Talk).
Rasmus PaghPublished in: MFCS (2017)
Keyphrases
- search problems
- invited talk
- high dimensional
- search algorithm
- orders of magnitude
- random instances
- heuristic search
- search strategies
- selected papers
- knowledge discovery and data mining
- iterative deepening
- heuristic search algorithms
- low dimensional
- similarity search
- search space
- feature space
- computational complexity
- constraint satisfaction problems
- recent advances
- information retrieval
- genetic algorithm
- test collection
- np complete
- information retrieval systems
- association rules
- artificial intelligence
- program committee