7150 search results - page 339 / 1430 » An Approximation Algorithm for Approximation Rank |
147
click to vote
ANSS
2005
IEEE
16 years 11 days ago
2005
IEEE
The analysis of discrete stochastic models such as generally distributed stochastic Petri nets can be done using state space-based methods. The behavior of the model is described ...
163
click to vote
CONIELECOMP
2005
IEEE
16 years 11 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
200
click to vote
WAOA
2005
Springer
16 years 6 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
165
click to vote
SPIRE
1999
Springer
15 years 11 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
178
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...