Results 1  10
of
167,216
ReadOnce Functions and Query Evaluation in Probabilistic Databases
"... Probabilistic databases hold promise of being a viable means for largescale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluat ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
empirically demonstrate that our proposed techniques are (1) orders of magnitude faster than generic inference algorithms when used to evaluate general readonce functions, and (2) for the special case of hierarchical queries, they rival the efficiency of prior techniques specifically designed to handle
Faster Query Answering in Probabilistic Databases using ReadOnce Functions
"... A boolean expression is in readonce form if each of its variables appears exactly once. When the variables denote independent events in a probability space, the probability of the event denoted by the whole expression in readonce form can be computed in polynomial time (whereas the general problem ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
problem for arbitrary expressions is #Pcomplete). Known approaches to checking readonce property seem to require putting these expressions in disjunctive normal form. In this paper, we tell a better story for a large subclass of boolean event expressions: those that are generated by conjunctive queries
Learning Probabilistic Readonce Formulas on Product Distributions
"... Abstract. This paper presents a polynomialtime algorithm for inferring a probabilistic generalization of the class of readonce Boolean formulas over the usual basis {AND, OR, NOT}. The algorithm effectively infers a good approximation of the target formula when provided with random examples which ..."
Abstract
 Add to MetaCart
Abstract. This paper presents a polynomialtime algorithm for inferring a probabilistic generalization of the class of readonce Boolean formulas over the usual basis {AND, OR, NOT}. The algorithm effectively infers a good approximation of the target formula when provided with random examples which
LEARNING ARITHMETIC READONCE FORMULAS*
"... Abstract. A formula is readonce if each variable appears at most once in it. An arithmetic readonce formula is one in which the operators are addition, subtraction, multiplication, and division. We present polynomial time algorithms for exact learning of arithmetic readonce formulas over a field. ..."
Abstract
 Add to MetaCart
. We present a membership and equivalence query algorithm that identifies arithmetic readonce formulas over an arbitrary field. We present a randomized membership query algorithm (i.e., a randomized black box interpolation algorithm) that identifies such formulas over finite fields with at least 2n
Optimizing Hardware Cache to ReadOnce Memory Accesses
, 2003
"... Hardware memory caches improve memory access speed by taking advantage of the temporal and spatial locality common to most memory references. By assuming that access patterns exhibit these localities, hardware designers can optimize caches design, creating systems in which more than 95% of memory re ..."
Abstract
 Add to MetaCart
Hardware memory caches improve memory access speed by taking advantage of the temporal and spatial locality common to most memory references. By assuming that access patterns exhibit these localities, hardware designers can optimize caches design, creating systems in which more than 95% of memory references in an average program need not access main memory.
Certificates of NonMembership for Classes of ReadOnce Functions
"... Abstract. A certificate of nonmembership for a Boolean function f with respect to a class C, f ̸ ∈ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function h ∈ C. We study certificates of nonmembership with respect to several classes of readonc ..."
Abstract
 Add to MetaCart
Abstract. A certificate of nonmembership for a Boolean function f with respect to a class C, f ̸ ∈ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function h ∈ C. We study certificates of nonmembership with respect to several classes of readonce
Theory revision with queries: Horn, readonce, and parity formulas
 Artificial Intelligence
, 2004
"... A theory, in this context, is a Boolean formula; it is used to classify instances, or truth assignments. Theories can model realworld phenomena, and can do so more or less correctly. The theory revision, or concept revision, problem is to correct a given, roughly correct concept. This problem is co ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
is considered here in the model of learning with equivalence and membership queries. A revision algorithm is considered efficient if the number of queries it makes is polynomial in the revision distance between the initial theory and the target theory, and polylogarithmic in the number of variables and the size
Efficient Query Evaluation on Probabilistic Databases
"... We describe a system that supports arbitrarily complex SQL queries with ”uncertain ” predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is query evaluation. We describe an optimization algorithm that can co ..."
Abstract
 Add to MetaCart
We describe a system that supports arbitrarily complex SQL queries with ”uncertain ” predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Retrieval. Our main focus is query evaluation. We describe an optimization algorithm that can
Queries with Difference on Probabilistic Databases
"... We study the feasibility of the exact and approximate computation of the probability of relational queries with difference on tupleindependent databases. We show that even the difference between two “safe ” conjunctive queries without selfjoins is “unsafe ” for exact computation. We turn to approx ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We study the feasibility of the exact and approximate computation of the probability of relational queries with difference on tupleindependent databases. We show that even the difference between two “safe ” conjunctive queries without selfjoins is “unsafe ” for exact computation. We turn
A Probabilistic Query Language
, 1994
"... We define a new query language for data and knowledge bases. This language is able to deal with weighted or uncertain base and derived information and reduces to a known query language in case that all information is deterministic. We show that this language is probabilistic in the sense of axiomati ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We define a new query language for data and knowledge bases. This language is able to deal with weighted or uncertain base and derived information and reduces to a known query language in case that all information is deterministic. We show that this language is probabilistic in the sense
Results 1  10
of
167,216