911 search results - page 168 / 183 » On the Distance of Databases |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
KDD
2007
ACM
14 years 9 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...
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
SIGMOD
2008
ACM
14 years 8 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...