1929 search results - page 168 / 386 » Load Balancing with Memory |
90
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
114
click to vote
ICIAP
2009
ACM
15 years 5 months ago
2009
ACM
This paper presents a framework for using high-level visual information to enhance the performance of automatic color constancy algorithms. The approach is based on recognizing spe...
CLOUDCOM
2010
Springer
14 years 10 months ago
2010
Springer
Checkpointing is a widely used mechanism for supporting fault tolerance, but notorious in its high-cost disk access. The idea of memory-based checkpointing has been extensively stu...
106
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
80
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...