Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities.
Dana RonRocco A. ServedioPublished in: Algorithmica (2015)
Keyphrases
- lower bound
- machine learning
- upper and lower bounds
- running times
- online algorithms
- computational complexity
- significant improvement
- worst case
- upper bound
- orders of magnitude
- computationally efficient
- algorithms require
- error bounds
- test cases
- similarity search
- theoretical analysis
- computational cost
- data structure
- image segmentation