IACR
2011
12 years 11 months ago
2011
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
APPROX
2011
Springer
12 years 11 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
ICCV
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
ICCV
2011
IEEE
12 years 11 months ago
2011
IEEE
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
FOGA
2011
13 years 3 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
In this paper we characterize (octal) bent generalized Boolean functions defined on Zn 2 with values in Z8. Moreover, we propose several constructions of such generalized bent fun...
SETA
2010
Springer
13 years 10 months ago
2010
Springer
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
JELIA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
RSA
2008
13 years 11 months ago
2008
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
ECCC
2008
13 years 11 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...