Sciweavers

351 search results - page 34 / 71
» Classical proof forestry
Sort
View
ASIACRYPT
2006
Springer
13 years 11 months ago
KFC - The Krazy Feistel Cipher
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
Thomas Baignères, Matthieu Finiasz
CSCLP
2006
Springer
13 years 11 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
CATS
2006
13 years 9 months ago
A Polynomial Algorithm for Codes Based on Directed Graphs
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
A. V. Kelarev
IJCAI
2003
13 years 9 months ago
AUC: a Statistically Consistent and more Discriminating Measure than Accuracy
Predictive accuracy has been used as the main and often only evaluation criterion for the predictive performance of classification learning algorithms. In recent years, the area ...
Charles X. Ling, Jin Huang, Harry Zhang
COMBINATORICS
2007
75views more  COMBINATORICS 2007»
13 years 7 months ago
Maximal Projective Degrees for Strict Partitions
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
D. Bernstein, A. Henke, A. Regev