Sciweavers

4255 search results - page 59 / 851
» On Learning Boolean Functions
Sort
View
JELIA
2010
Springer
14 years 8 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
ICML
2009
IEEE
15 years 10 months ago
Multi-assignment clustering for Boolean data
Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, w...
Andreas P. Streich, Mario Frank, David A. Basin, J...
SETA
2010
Springer
164views Mathematics» more  SETA 2010»
14 years 8 months ago
Synchronization of Boolean Dynamical Systems: A Spectral Characterization
Abstract. In this paper a spectral characterization of the synchronization property of Boolean dynamical systems is provided. Conditions on the spectrum of the next-state function ...
Jérémy Parriaux, Philippe Guillot, G...
DAC
1996
ACM
15 years 1 months ago
A Boolean Approach to Performance-Directed Technology Mapping for LUT-Based FPGA Designs
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
Christian Legl, Bernd Wurth, Klaus Eckl
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 6 days ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...