1120 search results - page 159 / 224 » time 1999 |
150
click to vote
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
140
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
135
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
121
Voted
SIGCOMM
1999
ACM
15 years 8 months ago
1999
ACM
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
141
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...