Sciweavers

138 search results - page 6 / 28
» Entropy Numbers of Linear Function Classes
Sort
View
69
Voted
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 1 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
90
Voted
STACS
1999
Springer
15 years 1 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
97
Voted
TFS
2008
129views more  TFS 2008»
14 years 8 months ago
A Functional-Link-Based Neurofuzzy Network for Nonlinear System Control
Abstract--This study presents a functional-link-based neurofuzzy network (FLNFN) structure for nonlinear system control. The proposed FLNFN model uses a functional link neural netw...
Cheng-Hung Chen, Cheng-Jian Lin, Chin-Teng Lin
RSA
2008
81views more  RSA 2008»
14 years 9 months ago
Analyzing linear mergers
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
Zeev Dvir, Ran Raz
88
Voted
TCS
2008
14 years 9 months ago
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
Miguel Couceiro, Maurice Pouzet