Sciweavers

706 search results - page 94 / 142
» On a quasi-ordering on Boolean functions
Sort
View
NIPS
1994
15 years 7 months ago
Learning Stochastic Perceptrons Under k-Blocking Distributions
We present a statistical method that PAC learns the class of stochastic perceptrons with arbitrary monotonic activation function and weights wi {-1, 0, +1} when the probability d...
Mario Marchand, Saeed Hadjifaradji
SCP
1998
134views more  SCP 1998»
15 years 6 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne
JUCS
2010
143views more  JUCS 2010»
15 years 4 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
KDD
2004
ACM
110views Data Mining» more  KDD 2004»
16 years 6 months ago
Generalizing the notion of support
The goal of this paper is to show that generalizing the notion of support can be useful in extending association analysis to non-traditional types of patterns and non-binary data....
Michael Steinbach, Pang-Ning Tan, Hui Xiong, Vipin...
JSAT
2006
91views more  JSAT 2006»
15 years 6 months ago
Extending Existential Quantification in Conjunctions of BDDs
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Sean Weaver, John V. Franco, John S. Schlipf