874 search results - page 71 / 175 » Faster Algorithms for Semi-Matching Problems |
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we ...
SIAMSC
2008
13 years 7 months ago
2008
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
TKDE
2008
13 years 7 months ago
2008
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...