77 search results - page 12 / 16 » Extended Viterbi algorithm for optimized word HMMS |
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
SIAMSC
2010
13 years 2 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
EMO
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...