Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351).
Dmitriy BilykMichael GnewuchJan VybíralLarisa YaroslavtsevaKumar HarshaPublished in: Dagstuhl Reports (2023)
Keyphrases
- optimization problems
- computational issues
- computational complexity
- problems in computer vision
- computational cost
- benchmark problems
- space complexity
- test problems
- computationally efficient
- related problems
- continuous domains
- benchmark datasets
- np hard problems
- difficult problems
- practical problems
- memory requirements
- theoretical analysis
- worst case
- computational geometry
- computationally hard
- iterative algorithms
- specific problems
- learning algorithm
- convex optimization problems
- polynomial time complexity
- orders of magnitude
- data mining
- continuous variables
- high computational complexity
- data mining tasks
- search methods
- computational problems
- exact and approximate
- greedy algorithms
- lower complexity
- decision problems
- search space
- data structure