69 search results - page 12 / 14 » Estimating the detector coverage in a negative selection alg... |
KDD
2001
ACM
14 years 9 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
PRL
2007
13 years 8 months ago
2007
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
DSN
2008
IEEE
14 years 3 months ago
2008
IEEE
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
PODS
1999
ACM
14 years 26 days ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
IAT
2009
IEEE
14 years 3 months ago
2009
IEEE
Collaborative Filtering based on similarity suffers from a variety of problems such as sparsity and scalability. In this paper, we propose an ontological model of trust between us...