876 search results - page 149 / 176 » Limits on the Usefulness of Random Oracles |
166
click to vote
P2P
2007
IEEE
16 years 23 days 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 ...
166
click to vote
CIKM
2007
Springer
16 years 20 days 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...
183
click to vote
INFOSCALE
2006
ACM
16 years 13 days 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...
186
click to vote
STACS
2005
Springer
15 years 12 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 ...
141
click to vote
SIGMETRICS
2004
ACM
15 years 12 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...