Sciweavers

2079 search results - page 341 / 416
» Universality of random graphs
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 8 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
COLT
2008
Springer
15 years 5 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
INFOCOM
2009
IEEE
15 years 10 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
WWW
2005
ACM
16 years 4 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
INFOCOM
2009
IEEE
15 years 10 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...