Results 1  10
of
151
Oblivious bounds on the probability of Boolean functions
 ACM Trans. Database Syst. (TODS
"... This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. w ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i
Oblivious Bounds on the Probability of Boolean Functions
, 2013
"... This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i
Constructing and Pruning Spanners in the CacheOblivious Model
"... A tspanner for a point set S ⊂ Rd is a Euclidean graph G = (S,E) in which the length of the shortest path between two arbitrary points p, q ∈ S is at most ttimes the Euclidean distance between them. The minimum value t ′ for which a Euclidean graph G = (S,E) is a t′spanner for its vertex set S is ..."
Abstract
 Add to MetaCart
S is called the dilation of G. Many algorithms are known that compute tspanners for a given point set S ⊂ Rd with O(S) edges and additional properties such as bounded degree, small spanner diameter and low weight; see, e.g., the survey [10]. In addition to the construction of tspanners, the problem
Lower Bounds for Deterministic and Nondeterministic Branching Programs
 in Proceedings of the FCT'91, Lecture Notes in Computer Science
, 1991
"... We survey lower bounds established for the complexity of computing explicitly given Boolean functions by switchingandrectifier networks, branching programs and switching networks. We first consider the unrestricted case and then proceed to various restricted models. Among these are monotone networ ..."
Abstract

Cited by 64 (4 self)
 Add to MetaCart
networks, boundedwidth devices , oblivious devices and readk times only devices. 1 Introduction The main goal of the Boolean complexity theory is to prove lower bounds on the complexity of computing "explicitly given" Boolean functions in interesting computational models. By "
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
investments, using a comprehensive sample of U.S. based VCs over the period 1980 to 2003. VC funds whose parent firms enjoy more influential network positions have significantly better performance, as measured by the proportion of portfolio company investments that are successfully exited through an initial
Counting Models for 2SAT and 3SAT Formulae
"... We here present algorithms for counting models and maxweight models for 2sat and 3sat formulae. They use polynomial space and run in O(1.2561^n) and O(1.6737^n) time, respectively, where n is the number of variables. This is faster than the previously best algorithms for counting nonweighted model ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We here present algorithms for counting models and maxweight models for 2sat and 3sat formulae. They use polynomial space and run in O(1.2561^n) and O(1.6737^n) time, respectively, where n is the number of variables. This is faster than the previously best algorithms for counting nonweighted
Model Counting of Query Expressions: Limitations of Propositional Methods∗
"... Query evaluation in tupleindependent probabilistic databases is the problem of computing the probability of an answer to a query given independent probabilities of the individual tuples in a database instance. There are two main approaches to this problem: (1) in grounded inference one first obtain ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
obtains the lineage for the query and database instance as a Boolean formula, then performs weighted model counting on the lineage (i.e., computes the probability of the lineage given probabilities of its independent Boolean variables); (2) in methods known as lifted inference or extensional query
likelihood and the role of models in molecular phylogenetics.
 Mol. Biol. Evol.
, 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between
The cell probe complexity of dynamic range counting
 In Proc. 44th ACM Symposium on Theory of Computation
, 2012
"... In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we prove the highest lower bound to date for any explicit problem, namely a lower bound of tq = Ω((lg n / lg(wtu)) 2). Here n i ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
lower bound of Ω(lg n), due to Pǎtra¸scu and Demaine [SICOMP’06]. We prove the lower bound for the fundamental problem of weighted orthogonal range counting. In this problem, we are to support insertions of twodimensional points, each assigned a Θ(lg n)bit integer weight. A query to this problem
Improved Inapproximability Results for Counting Independent Sets in the HardCore Model
, 2011
"... We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree ∆. More generally, for an input graph G = (V, E) and an activity λ> 0, we are interested in the quantity ZG(λ) defined as the sum over independent sets I weighted as w(I) ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree ∆. More generally, for an input graph G = (V, E) and an activity λ> 0, we are interested in the quantity ZG(λ) defined as the sum over independent sets I weighted as w
Results 1  10
of
151