We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
: Nowadays, while large-sized multimedia objects are becoming very popular throughout the Internet, one of the important issues appears to be the acceleration of content delivery n...
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new ...