We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity n(@e,d) of its d-variate component to be solved to within @e is not exponential in any positive ...
This paper focuses on the problem of implementing web applications on top of weakly consistent geo-replicated systems. Several techniques, such as CRDTs, have been proposed to achieve state convergence on a per-object and per-data type basis. However, ...
An algorithm is a weak learner if with some small probability it outputs a hypothesis with error slightly below 50%. This paper presents sufficient conditions for weak learning.
Our main result requires a “consistency oracle” for the concept class ℱ ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
