We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...