Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 19341).
Dmitriy BilykAicke HinrichsFrances Y. KuoKlaus RitterPublished in: Dagstuhl Reports (2019)
Keyphrases
- optimization problems
- computational issues
- related problems
- worst case
- problems in computer vision
- test problems
- greedy algorithms
- computational complexity
- np hard problems
- practical problems
- space complexity
- computational cost
- orders of magnitude
- times faster
- continuous domains
- theoretical guarantees
- neural network
- benchmark problems
- memory requirements
- theoretical analysis
- learning algorithm
- complexity analysis
- search methods
- computational problems
- discrete data
- complexity bounds
- machine learning
- data sets
- run times
- numeric values