381 search results - page 14 / 77 » Approximate Matching of Hierarchical Data Using pq-Grams |
SPIRE
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
CORR
1999
Springer
13 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
IMC
2006
ACM
14 years 20 days ago
2006
ACM
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
FGCN
2008
IEEE
14 years 1 months ago
2008
IEEE
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...