Sciweavers

707 search results - page 115 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 7 months ago
Entropy of capacities on lattices and set systems
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
Aoi Honda, Michel Grabisch
VLDB
1992
ACM
173views Database» more  VLDB 1992»
13 years 12 months ago
An Extended Relational Database Model for Uncertain and Imprecise Information
We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is basedon Dempster-Shafertheory which has become popular in ...
Suk Kyoon Lee
FSE
2006
Springer
124views Cryptology» more  FSE 2006»
13 years 11 months ago
Cryptanalysis of Grain
Abstract. Grain [11] is a lightweight stream cipher submitted by M. Hell, T. Johansson, and W. Meier to the eSTREAM call for stream cipher proposals of the European project ECRYPT ...
Côme Berbain, Henri Gilbert, Alexander Maxim...
AAAI
2008
13 years 10 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan