1376 search results - page 34 / 276 » Searching Trees: An Essay |
119
click to vote
COCOON
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
107
click to vote
KDD
2008
ACM
16 years 6 days ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
100
click to vote
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
DEXA
2005
Springer
15 years 5 months ago
2005
Springer
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...