1091 search results - page 150 / 219 » Approximation in Databases |
113
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...
113
Voted
KDD
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
114
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Score normalization is indispensable in distributed retrieval and fusion or meta-search where merging of result-lists is required. Distributional approaches to score normalization...
118
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...