16 search results - page 2 / 4 » Limits on the rate of locally testable affine-invariant code... |
PAMI
1998
13 years 5 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
PODC
2012
ACM
11 years 8 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
CORR
2011
Springer
13 years 17 days ago
2011
Springer
—We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rankmodulation is...
ACSAC
2002
IEEE
13 years 10 months ago
2002
IEEE
Modern computer viruses spread incredibly quickly, far faster than human-mediated responses. This greatly increases the damage that they cause. This paper presents an approach to ...
ICIP
2008
IEEE
14 years 7 months ago
2008
IEEE
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....