350 search results - page 53 / 70 » Simple Efficient Load-Balancing Algorithms for Peer-to-Peer ... |
106
click to vote
STOC
2004
ACM
16 years 4 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
205
Voted
CC
2009
Springer
16 years 15 days ago
2009
Springer
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
177
click to vote
POPL
2008
ACM
16 years 5 days ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
KDD
1995
ACM
15 years 3 months ago
1995
ACM
We discuss the use of database met hods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data stru...
105
click to vote
ISLPED
2010
ACM
15 years 2 days ago
2010
ACM
We have developed a system architecture, measuring and modeling techniques, and algorithms for on-line power and energy optimization and thermal management. The starting point for...