Sciweavers

8431 search results - page 139 / 1687
» Algorithmically Independent Sequences
Sort
View
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
TIT
2011
141views more  TIT 2011»
14 years 5 months ago
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications
New families of near-complementary sequences are presented for peak power control in multicarrier communications. A framework for near-complementary sequences is given by the expl...
Nam Yul Yu, Guang Gong
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
15 years 3 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
ACL
2009
14 years 7 months ago
A non-contiguous Tree Sequence Alignment-based Model for Statistical Machine Translation
The tree sequence based translation model allows the violation of syntactic boundaries in a rule to capture non-syntactic phrases, where a tree sequence is a contiguous sequence o...
Jun Sun, Min Zhang, Chew Lim Tan
ACL
2010
14 years 8 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...