13214 search results - page 2628 / 2643 » Pseudorandomness for network algorithms |
BMCBI
2006
13 years 7 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
COMCOM
2006
13 years 7 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...