Sciweavers

706 search results - page 100 / 142
» On a quasi-ordering on Boolean functions
Sort
View
ECCC
2006
96views more  ECCC 2006»
13 years 7 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
MJ
2008
58views more  MJ 2008»
13 years 7 months ago
Using multi-threshold threshold gates in RTD-based logic design: A case study
Abstract - The basic building blocks for Resonant Tunnelling Diode (RTD) logic circuits are Threshold Gates (TGs) instead of the conventional Boolean gates (AND, OR, NAND, NOR) due...
Héctor Pettenghi, Maria J. Avedillo, Jos&ea...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
TIT
2008
105views more  TIT 2008»
13 years 6 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb