4332 search results - page 255 / 867 » A Probabilistic Identification Result |
186
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
190
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
174
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
169
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
243
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...