3179 search results - page 100 / 636 » Applications of PCF Theory |
CAP
2010
13 years 3 months ago
2010
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...
EUROCRYPT
2012
Springer
11 years 11 months ago
2012
Springer
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...
ICEIS
2007
IEEE
14 years 3 months ago
2007
IEEE
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...
PR
2007
13 years 8 months ago
2007
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...
IJAR
2008
13 years 7 months ago
2008
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...