3818 search results - page 60 / 764 » Word Problems on Compressed Words |
131
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
133
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
132
click to vote
IPM
2011
14 years 7 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
112
click to vote
DNA
2005
Springer
15 years 10 months ago
2005
Springer
We survey the biochemical constraints useful for the design of DNA code words for DNA computation. We define the DNA/RNA Code Constraint problem and cover biochemistry topics rel...
130
click to vote
MM
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we consider the incoherence problem of the visual words in bag-of-words vocabularies. Different from existing work, which performs assignment of words based solely ...