62 search results - page 11 / 13 » Efficient Data Structures and Parallel Algorithms for Associ... |
SAC
2002
ACM
13 years 5 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
JMLR
2010
13 years 23 days ago
2010
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
RECOMB
2002
Springer
14 years 6 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
ICDCSW
2002
IEEE
13 years 11 months ago
2002
IEEE
A key issue when designing and implementing largescale publish/subscribe systems is how to efficiently propagate subscriptions among the brokers of the system. Brokers require thi...
KDD
2002
ACM
14 years 6 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...