17 search results - page 2 / 4 » The Haar Tree: A Refined Synopsis Data Structure |
KDD
2009
ACM
14 years 6 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
VMCAI
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
ESA
2006
Springer
13 years 10 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
EDBT
2004
ACM
14 years 6 months ago
2004
ACM
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
BMCBI
2006
13 years 6 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...