Sciweavers

1021 search results - page 37 / 205
» On the correlation of binary sequences
Sort
View
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
15 years 11 months ago
Sequenced Subset Operators: Definition and Implementation
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
Joseph Dunn, Sean Davey, Anne Descour, Richard T. ...
VTC
2010
IEEE
153views Communications» more  VTC 2010»
14 years 8 months ago
H.264 Wireless Video Telephony Using Iteratively-Detected Binary Self-Concatenated Coding
— In this contribution we propose a robust H.264 coded wireless video transmission scheme using iteratively decoded self-concatenated convolutional coding (SECCC). The proposed S...
Nasruminallah, Muhammad Fasih Uddin Butt, Soon Xin...
BIOINFORMATICS
2000
99views more  BIOINFORMATICS 2000»
14 years 9 months ago
GeneRAGE: a robust algorithm for sequence clustering and domain detection
Motivation: Efficient, accurate and automatic clustering of large protein sequence datasets, such as complete proteomes, into families, according to sequence similarity. Detection...
Anton J. Enright, Christos A. Ouzounis
DCC
2006
IEEE
15 years 9 months ago
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
Wilfried Meidl, Arne Winterhof
MFCS
2000
Springer
15 years 1 months ago
On the Autoreducibility of Random Sequences
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
Todd Ebert, Heribert Vollmer