217 search results - page 26 / 44 » On the Fine Structure of Large Search Spaces |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
112
click to vote
3DIM
2003
IEEE
15 years 3 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
111
click to vote
JAIR
2006
14 years 11 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
114
click to vote
IADIS
2008
15 years 1 months ago
2008
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
AAAI
2008
15 years 2 months ago
2008
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...