4843 search results - page 175 / 969 » The Shortcut Problem - Complexity and Approximation |
151
click to vote
DASFAA
2003
IEEE
15 years 8 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...
153
Voted
CORR
2011
Springer
14 years 10 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...
258
click to vote
IACR
2011
14 years 2 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...
125
click to vote
INFOCOM
2009
IEEE
15 years 10 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....
134
click to vote
SECON
2007
IEEE
15 years 9 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...