Sciweavers

1021 search results - page 119 / 205
» On the correlation of binary sequences
Sort
View
IH
2009
Springer
15 years 10 months ago
Estimating the Minimal Length of Tardos Code
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...
Teddy Furon, Luis Pérez-Freire, Arnaud Guya...
DSD
2007
IEEE
98views Hardware» more  DSD 2007»
15 years 10 months ago
Fault Diagnosis in Integrated Circuits with BIST
This paper presents an optimized fault diagnosing procedure applicable in Built-in Self-Test environments. Instead of the known approach based on a simple bisection of patterns in...
Raimund Ubar, Sergei Kostin, Jaan Raik, Teet Evart...
LPAR
2005
Springer
15 years 9 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
126
Voted
CISC
2006
Springer
106views Cryptology» more  CISC 2006»
15 years 8 months ago
A General Construction of Tweakable Block Ciphers and Different Modes of Operations
This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway's TBC co...
Debrup Chakraborty, Palash Sarkar
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 7 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...