1272 search results - page 30 / 255 » Approximate Parameterized Matching |
140
click to vote
CPM
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
133
click to vote
IDEAS
2007
IEEE
15 years 9 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
139
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
123
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
135
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...