Sciweavers

373 search results - page 70 / 75
» Learning Arithmetic Circuits
Sort
View
TSMC
2008
137views more  TSMC 2008»
13 years 7 months ago
A Type-2 Self-Organizing Neural Fuzzy System and Its FPGA Implementation
This paper proposes a type-2 self-organizing neural fuzzy system (T2SONFS) and its hardware implementation. The antecedent parts in each T2SONFS fuzzy rule are interval type-2 fuzz...
Chia-Feng Juang, Yu-Wei Tsao
SIAMCOMP
2011
13 years 2 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
AIA
2006
13 years 9 months ago
Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
Benno Stein, Oliver Niggemann, Theodor Lettmann
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio