1091 search results - page 148 / 219 » Approximation in Databases |
121
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
141
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
139
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
115
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
141
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...