630 search results - page 61 / 126 » Optimized union of non-disjoint distributed data sets |
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
AAAI
2007
15 years 4 days ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
169
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
TVLSI
2010
14 years 4 months ago
2010
In many applications, a reduction of the amount of the original data or a representation of the original data by a small set of variables is often required. Among many techniques, ...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...