245 search results - page 45 / 49 » Tree pattern mining with tree automata constraints |
KDD
2003
ACM
14 years 7 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
KDD
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we discuss the important practical problem of customer wallet estimation, i.e., estimation of potential spending by customers (rather than their expected spending). ...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...