12519 search results - page 278 / 2504 » Approximation Problems Categories |
198
click to vote
CPM
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
188
Voted
DASFAA
2003
IEEE
15 years 12 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
329
click to vote
IACR
2011
14 years 6 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
168
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....