Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
In this paper we are concerned with innovation in the development of mobile applications. In particular, we address how we may come to think systematically about innovative aspects...
Jens Henrik Hosbond, Peter Axel Nielsen, Ivan Aaen
The hit-or-miss transform (HMT) is a fundamental operation on binary images, widely used since 40 years. As it is not increasing, its extension to grey-level images is not straigh...
We consider here the case where our knowledge is partial and based on a betting density function which is n-dimensional Gaussian. The explicit formulation of the least committed b...
Francois Caron, Branko Ristic, Emmanuel Duflos, Ph...