Sciweavers

169 search results - page 9 / 34
» Reduced Length Checking Sequences
Sort
View
ACL
2010
13 years 6 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,...
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 8 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic
SPIN
2010
Springer
13 years 6 months ago
Nevertrace Claims for Model Checking
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
Zhe Chen, Gilles Motet
IJBRA
2006
111views more  IJBRA 2006»
13 years 8 months ago
Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Co...
PRDC
2007
IEEE
14 years 2 months ago
An Automatic Real-Time Analysis of the Time to Reach Consensus
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Tatsuhiro Tsuchiya, André Schiper