Results 1 - 2 of 2
- In Proceedings of the IEEE Conference on Systems, Man, and Cybernetics , 2007
"... ..."(Show Context)
...a generalization of the kd-tree andprovides substantially improved space requirements for storing all conjunctive counting queries over symbolic datasets. Further refinements to the structure (, =-=-=-) have made ADtrees widely applicable to a large number of problems that require efficient access to counts of combinations of features. A. Description of the ADtree ADtrees are similar to kd-trees an...
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2015 The Pennsylvania State University