1403 search results - page 105 / 281 » Set cover algorithms for very large datasets |
140
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
282
click to vote
AICCSA
2008
IEEE
15 years 4 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
138
click to vote
MICCAI
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
148
click to vote
VLSID
2008
IEEE
16 years 4 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
147
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...