Sciweavers

1381 search results - page 69 / 277
» Structural signatures for tree data structures
Sort
View
DMIN
2006
137views Data Mining» more  DMIN 2006»
14 years 11 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
UAI
2008
14 years 11 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
14 years 7 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
VLDB
2006
ACM
115views Database» more  VLDB 2006»
15 years 10 months ago
Integrating document and data retrieval based on XML
For querying structured and semistructured data, data retrieval and document retrieval are two valuable and complementary techniques that have not yet been fully integrated. In thi...
Jan-Marco Bremer, Michael Gertz
APAL
2007
104views more  APAL 2007»
14 years 10 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi