126 search results - page 1 / 26 » Lower Bounds for Set Intersection Queries |
SODA
1993
ACM
13 years 6 months ago
1993
ACM
ML
2007
ACM
13 years 5 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
EJC
2000
13 years 5 months ago
2000
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...