Sciweavers

1284 search results - page 95 / 257
» Data Structures for Mergeable Trees
Sort
View
IFIP
2004
Springer
14 years 1 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
APLAS
2004
ACM
14 years 1 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
MCS
2008
Springer
13 years 7 months ago
Detecting multiple mean breaks at unknown points in official time series
In this paper, we propose a computationally effective approach to detect multiple structural breaks in the mean occurring at unknown dates. We present a non-parametric approach th...
Carmela Cappelli, Richard N. Penny, William S. Rea...
EDBT
2009
ACM
110views Database» more  EDBT 2009»
14 years 9 days ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 1 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz