Sciweavers

314 search results - page 36 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra
IACR
2011
110views more  IACR 2011»
12 years 8 months ago
Decoding One Out of Many
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
Nicolas Sendrier
DCC
2008
IEEE
14 years 8 months ago
Word-Based Statistical Compressors as Natural Language Compression Boosters
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
Antonio Fariña, Gonzalo Navarro, José...
FGR
2002
IEEE
152views Biometrics» more  FGR 2002»
14 years 1 months ago
Evaluation of Gabor-Wavelet-Based Facial Action Unit Recognition in Image Sequences of Increasing Complexity
Previous work suggests that Gabor-wavelet-based methods can achieve high sensitivity and specificity for emotionspecified expressions (e.g., happy, sad) and single action units ...
Ying-li Tian, Takeo Kanade, Jeffrey F. Cohn
GVD
2004
111views Database» more  GVD 2004»
13 years 10 months ago
Detecting Logical Errors in SQL Queries
Abstract. Checking the consistency of query conditions is an old problem, and there are already many proposed solutions. Since the problem is in general undecidable, there is not a...
Stefan Brass, Christian Goldberg