287 search results - page 5 / 58 » Communication complexity as a lower bound for learning in ga... |
ALT
1998
Springer
13 years 11 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
ERSHOV
2003
Springer
14 years 21 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
TCS
1998
13 years 7 months ago
1998
EUROCRYPT
2004
Springer
14 years 26 days ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...