1429 search results - page 165 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
BIRD
2008
Springer
13 years 11 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
Two Dimensional Hidden Markov Models (2D-HMMs) provide substantial benefits for many computer vision and image analysis applications. Many fundamental image analysis problems, inc...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
RT
2004
Springer
14 years 2 months ago
2004
Springer
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...