2084 search results - page 233 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
108
click to vote
HPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
AAIM
2007
Springer
15 years 2 months ago
2007
Springer
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
COLT
2008
Springer
14 years 12 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...