381 search results - page 10 / 77 » Approximate Matching of Hierarchical Data Using pq-Grams |
SEBD
2003
13 years 8 months ago
2003
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
TKDE
2008
13 years 6 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
KDD
2000
ACM
13 years 10 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
CIBCB
2007
IEEE
14 years 1 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...