Sciweavers

4850 search results - page 221 / 970
» Approximate Data Structures with Applications
Sort
View
WWW
2006
ACM
16 years 7 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
BMCBI
2007
144views more  BMCBI 2007»
15 years 6 months ago
Application of amino acid occurrence for discriminating different folding types of globular proteins
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
Y.-h. Taguchi, M. Michael Gromiha
ERLANG
2004
ACM
15 years 12 months ago
Structured programming using processes
Structured Programming techniques are applied to a personal accounting software application implemented in erlang as a demonstration of the utility of processes as design construc...
Jay Nelson
207
Voted
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
16 years 6 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
182
Voted
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
15 years 10 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng