1021 search results - page 85 / 205 » On the correlation of binary sequences |
266
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
184
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: As in many different areas of science and technology, most important problems in bioinformatics rely on the proper development and assessment of binary classifiers. A ...
144
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
An efficient algorithm for inter-frame coding in the H.264/AVC standard is extended to provide more significant speedup in computational performance for sequences containing high ...
147
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
179
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...