633 search results - page 39 / 127 » Locality and Hard SAT-Instances |
PAKDD
2010
ACM
14 years 1 months ago
2010
ACM
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
SADM
2010
13 years 4 months ago
2010
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
WSDM
2012
ACM
12 years 5 months ago
2012
ACM
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this paper, we present a composite hypothesis testing approach for cooperative spectrum sensing. We derive the optimal likelihood ratio test (LRT) statistic based on the Neym...
ACL
2004
13 years 11 months ago
2004
Exploiting unannotated natural language data is hard largely because unsupervised parameter estimation is hard. We describe deterministic annealing (Rose et al., 1990) as an appea...