1091 search results - page 144 / 219 » Approximation in Databases |
230
Voted
ICDE
1999
IEEE
16 years 4 months ago
1999
IEEE
In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedba...
105
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
112
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
103
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
97
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...