Sciweavers

4255 search results - page 81 / 851
» On Learning Boolean Functions
Sort
View
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 7 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
KDD
2010
ACM
279views Data Mining» more  KDD 2010»
15 years 1 months ago
Unifying dependent clustering and disparate clustering for non-homogeneous data
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
M. Shahriar Hossain, Satish Tadepalli, Layne T. Wa...
INFORMATICASI
1998
122views more  INFORMATICASI 1998»
14 years 9 months ago
Experimental Evaluation of Three Partition Selection Criteria for Decision Table Decomposition
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
Blaz Zupan, Marko Bohanec
FOCS
2010
IEEE
14 years 7 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan
ICML
2004
IEEE
15 years 3 months ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker