77 search results - page 10 / 16 » Extended Viterbi algorithm for optimized word HMMS |
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
WEA
2004
Springer
14 years 21 days ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
PR
2010
13 years 5 months ago
2010
The total variation-based image denoising model has been generalized and extended in numerous ways, improving its performance in different contexts. We propose a new penalty func...
IANDC
2008
13 years 7 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
CSL
2004
Springer
13 years 7 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...