Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function.
Andris AmbainisSatyanarayana V. LokamPublished in: LATIN (2000)
Keyphrases
- upper bound
- worst case
- lower bound
- newly defined
- error probability
- computational complexity
- tight bounds
- upper and lower bounds
- decision problems
- approximation error
- branch and bound
- computational cost
- data sets
- approximation algorithms
- generalization error
- space complexity
- piecewise linear
- sample size
- theoretical analysis
- linear functions
- search algorithm
- image segmentation