706 search results - page 98 / 142 » On a quasi-ordering on Boolean functions |
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ETFA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
ICDT
2003
ACM
14 years 28 days ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
EUROCRYPT
1999
Springer
14 years 13 hour ago
1999
Springer
Abstract. In this paper, we give some relationship between the nonlinearity of rational functions over F2n and the number of points of associated hyperelliptic curve. Using this, w...