1091 search results - page 39 / 219 » Approximation Algorithms for Data Placement Problems |
ISCAPDCS
2004
13 years 9 months ago
2004
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
PODS
2010
ACM
14 years 24 days ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
NIPS
2007
13 years 9 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...