152 search results - page 18 / 31 » Constructive Proofs of Concentration Bounds |
187
click to vote
AAIM
2007
Springer
16 years 23 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
170
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
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...
185
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
148
click to vote
SIAMCO
2008
15 years 6 months ago
2008
We give a new sufficient condition on the boundary conditions for the exponential stability of one-dimensional nonlinear hyperbolic systems on a bounded interval. Our proof relies ...