4843 search results - page 768 / 969 » The Shortcut Problem - Complexity and Approximation |
172
Voted
VLDB
2008
ACM
16 years 3 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 ...
222
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
163
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
140
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
125
Voted
WSDM
2010
ACM
16 years 27 days ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...