381 search results - page 9 / 77 » Approximate Matching of Hierarchical Data Using pq-Grams |
127
click to vote
WSOM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper is devoted to the analysis of career paths and employability. The state-of-the-art on this topic is rather poor in methodologies. Some authors propose distance...
131
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
143
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
153
Voted
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
126
Voted
CGI
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...