We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
We consider the self-calibration problem for a moving camera whose intrinsic parameters are known, except the focal length, which may vary freely across different views. The condi...
Two architectures and VLSI implementations of the AES Proposal, Rijndael, are presented in this paper. These alternative architectures are operated both for encryption and decrypti...
Collaborative filtering exploits user preferences, generally ratings, to provide them with recommendations. However, the ratings may not be completely trustworthy: the rating scale...
Armelle Brun, Ahmad Hamad, Olivier Buffet, Anne Bo...