62 search results - page 1 / 13 » Near Optimal Update-Broadcast of Data Sets |
MDM
2007
Springer
13 years 11 months ago
2007
Springer
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
ISCA
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
DIALM
2007
ACM
13 years 8 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
OTM
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...
JMLR
2012
11 years 7 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...