4874 search results - page 348 / 975 » Information theory for data management |
215
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
217
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
178
Voted
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
148
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we present the design of a multidisciplined problem solving environment (MPSE) for supporting an efficient prediction capability for the response of multiscale interd...
224
click to vote
DAMON
2008
Springer
15 years 8 months ago
2008
Springer
Partitioning is a key database task. In this paper we explore partitioning performance on a chip multiprocessor (CMP) that provides a relatively high degree of on-chip thread-leve...