1132 search results - page 182 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
166
click to vote
TCC
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
172
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
141
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
171
click to vote
EUROCOLT
1997
Springer
15 years 10 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...
160
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...