1092 search results - page 69 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
134
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
177
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
136
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
199
Voted
ECCC
2011
15 years 27 days ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
188
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...