15485 search results - page 2600 / 3097 » Computing Optimal Subsets |
198
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
207
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
242
click to vote
VLDB
2008
ACM
16 years 7 months ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
204
click to vote
PODS
2004
ACM
16 years 7 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
230
Voted
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...