13214 search results - page 335 / 2643 » Pseudorandomness for network algorithms |
200
click to vote
ACL
2012
13 years 9 months ago
2012
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
210
click to vote
DIALM
2004
ACM
16 years 6 days ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
191
click to vote
GI
1999
Springer
15 years 11 months ago
1999
Springer
d Abstract) Friedhelm Meyer auf der Heide Berthold V¨ocking† Matthias Westermann We present a general framework for the development of online algorithms for data manageme...
192
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
156
click to vote
GCC
2003
Springer
15 years 12 months ago
2003
Springer
Peer-to-peer networking is a hot buzzword that has been sweeping through the computing industry over the past year or so. Gnutella, as one of the first operational pure P2P systems...