481 search results - page 78 / 97 » Martin's game: a lower bound for the number of sets |
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
ICALP
1992
Springer
14 years 25 days ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
ML
2007
ACM
13 years 8 months ago
2007
ACM
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...