Sciweavers

1071 search results - page 103 / 215
» The Calculus of Algebraic Constructions
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
LOPSTR
1995
Springer
15 years 9 months ago
Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
Christoph Kreitz, Jens Otten, Stephan Schmitt
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
15 years 6 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
AES
2004
Springer
139views Cryptology» more  AES 2004»
15 years 11 months ago
The Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
Nicolas Courtois
SAIG
2001
Springer
15 years 10 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann