345 search results - page 63 / 69 » Computer-Assisted Simulation Proofs |
JOIN
2007
14 years 9 months ago
2007
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalabili...