215 search results - page 8 / 43 » On the Linear Number of Matching Substrings |
117
click to vote
JUCS
2010
14 years 11 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
166
Voted
APPROX
2011
Springer
14 years 13 days ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
97
Voted
JCT
2007
15 years 10 days ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
177
Voted
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
118
click to vote
EDBT
2008
ACM
16 years 17 days ago
2008
ACM
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...