1191 search results - page 48 / 239 » A new approach to nonrepetitive sequences |
TCS
1998
13 years 10 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
AAAI
2008
14 years 17 days ago
2008
We propose a new discriminative framework, namely Hidden Dynamic Conditional Random Fields (HDCRFs), for building probabilistic models which can capture both internal and external...
CSB
2004
IEEE
14 years 2 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...