876 search results - page 149 / 176 » Limits on the Usefulness of Random Oracles |
100
Voted
P2P
2007
IEEE
15 years 7 months ago
2007
IEEE
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
99
Voted
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
106
Voted
INFOSCALE
2006
ACM
15 years 6 months ago
2006
ACM
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
113
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
79
Voted
SIGMETRICS
2004
ACM
15 years 6 months ago
2004
ACM
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...