Results 1  10
of
931
Arbitrary Boolean Advertisements: The Final Step in Supporting the Boolean Publish/Subscribe Model
, 2006
"... Abstract. Publish/subscribe systems allow for an efficient filtering of incoming information. This filtering is based on the specifications of subscriber interests, which are registered with the system as subscriptions. Publishers conversely specify advertisements, describing the messages they will ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
they will send later on. What is missing so far is the support of arbitrary Boolean advertisements in publish/subscribe systems. Introducing the opportunity to specify these richer Boolean advertisements increases the accuracy of publishers to state their future messages compared to currently supported
An analysis of Bayesian classifiers
 IN PROCEEDINGS OF THE TENTH NATIONAL CONFERENCE ON ARTI CIAL INTELLIGENCE
, 1992
"... In this paper we present anaveragecase analysis of the Bayesian classifier, a simple induction algorithm that fares remarkably well on many learning tasks. Our analysis assumes a monotone conjunctive target concept, and independent, noisefree Boolean attributes. We calculate the probability that t ..."
Abstract

Cited by 440 (17 self)
 Add to MetaCart
In this paper we present anaveragecase analysis of the Bayesian classifier, a simple induction algorithm that fares remarkably well on many learning tasks. Our analysis assumes a monotone conjunctive target concept, and independent, noisefree Boolean attributes. We calculate the probability
Algebraic Decision Diagrams and their Applications
, 1993
"... In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and ..."
Abstract

Cited by 321 (18 self)
 Add to MetaCart
In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms
Optimizing Pub/Sub Systems by Advertisement Pruning
 In Proceedings of the 8th International Symposium on Distributed Objects and Applications (DOA 2006
, 2006
"... Abstract. Supporting advertisements in large publish/subscribe services has an improving influence on the system scalability. The additional application of event routing optimizations based on subscriptions further increases the event throughput and decreases the memory usage of publish/subscribe sy ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
/subscribe systems. However, also advertisementbased optimizations can improve these system properties but have been widely neglected so far. In particular, no current optimizations are applicable to advertisements defined as arbitrary Boolean filter expressions. In this paper, we outline the final milestone
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 280 (11 self)
 Add to MetaCart
We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We
PolySet Theory
 http://www.rbjones.com/rbjpub/pp/doc/t020.pdf. p011.tex; 25/01/2010; 13:13; p.12 13
"... This document is concerned with the specification of an interpretation of the first order language of set theory. The purpose of this is to provide an ontological basis for foundation systems suitable for the formal derivation of mathematics. The ontology is to include the pure wellfounded sets of ..."
Abstract

Cited by 259 (2 self)
 Add to MetaCart
of rank up to some arbitrary large cardinal together with the graphs of the polymorphic functions definable mathematical concepts. The interpretation is constructed by defining “names ” or “representatives ” for the sets in the domain of discourse by transfinite inductive definition in the context of a
ON THE ORTHOGONALIZATION OF ARBITRARY BOOLEAN FORMULAE
, 2004
"... The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolea ..."
Abstract
 Add to MetaCart
general procedure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae. 1.
Noise sensitivity of Boolean functions and applications to percolation
, 2008
"... It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted majority ..."
Abstract

Cited by 101 (18 self)
 Add to MetaCart
It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted
A ZeroOne Law for Boolean Privacy
 STOC 89 and SIAM J. Disc. Math
, 1991
"... A Boolean function f : A 1 \Theta A 2 \Theta : : : \Theta A n ! f0;1g is t  private if there exists a protocol for computing f so that no coalition of size t can infer any additional information from the execution, other than the value of the function. We show that f is d n 2 e  private if a ..."
Abstract

Cited by 87 (14 self)
 Add to MetaCart
if and only if it can be represented as f(x 1 ; x 2 ; : : : ; x n ) = f 1 (x 1 ) \Phi f 2 (x 2 ) \Phi : : : \Phi f n (x n ) ; where the f i are arbitrary Boolean functions. It follows that if f is d n 2 e  private, then it is also n  private. Combining this with a result of BenOr, Goldwasser
Hybrid Booleans
, 2009
"... In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new
Results 1  10
of
931