Sciweavers

433 search results - page 17 / 87
» Optimal Segmentation of Random Sequences
Sort
View
ICIP
1998
IEEE
16 years 1 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
ACL
2010
14 years 9 months ago
Jointly Optimizing a Two-Step Conditional Random Field Model for Machine Transliteration and Its Fast Decoding Algorithm
This paper presents a joint optimization method of a two-step conditional random field (CRF) model for machine transliteration and a fast decoding algorithm for the proposed metho...
Dong Yang, Paul R. Dixon, Sadaoki Furui
CSB
2003
IEEE
113views Bioinformatics» more  CSB 2003»
15 years 5 months ago
An Optimal DNA Segmentation Based on the MDL Principle
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankows...
99
Voted
ACL
1998
15 years 1 months ago
Optimal Multi-Paragraph Text Segmentation by Dynamic Programming
There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragra...
Oskari Heinonen
BMCBI
2006
139views more  BMCBI 2006»
14 years 11 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana