1632 search results - page 121 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
130
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
122
Voted
JSSPP
2004
Springer
15 years 9 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
107
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
164
click to vote
MST
2006
15 years 3 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...