Sciweavers

4255 search results - page 111 / 851
» On Learning Boolean Functions
Sort
View
DAC
2005
ACM
16 years 2 months ago
FPGA technology mapping: a study of optimality
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
Andrew C. Ling, Deshanand P. Singh, Stephen Dean B...
LISA
2004
15 years 3 months ago
Auto-configuration by File Construction: Configuration Management with newfig
A tool is described that provides for the automatic configuration of systems from a single description. The tool, newfig, uses two simple concepts to provide its functionality: bo...
William LeFebvre, David Snyder
ECCC
2010
104views more  ECCC 2010»
15 years 1 months ago
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
ENTCS
2008
102views more  ENTCS 2008»
15 years 1 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ICML
2006
IEEE
16 years 2 months ago
Learning a kernel function for classification with small training samples
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall