287 search results - page 37 / 58 » Communication complexity as a lower bound for learning in ga... |
DIGRA
2005
Springer
14 years 2 months ago
2005
Springer
Young people’s participation in online digital culture is one of the most efficient means by which they become proficient in the management of Information and Communications Tec...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
CRYPTO
2009
Springer
14 years 3 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
FOCS
1995
IEEE
14 years 6 days ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...