Sciweavers

706 search results - page 5 / 142
» On a quasi-ordering on Boolean functions
Sort
View
MFCS
2010
Springer
13 years 5 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
DLOG
2009
13 years 5 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
ICCV
2011
IEEE
12 years 7 months ago
Superpixels via Pseudo-Boolean Optimization
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...
Yuhang Zhang, Richard Hartley, John Mashford, Stew...
ISMVL
2002
IEEE
90views Hardware» more  ISMVL 2002»
14 years 16 days ago
A Conjunctive Canonical Expansion of Multiple-Valued Functions
A generalization of McMillan’s conjunctive expansion of Boolean functions [1] to the case of multiple-valued input binary-valued output functions is presented. It is based on th...
Elena Dubrova, Petra Färm
IACR
2011
115views more  IACR 2011»
12 years 7 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen