Results 1  10
of
336,030
nondeterministic graphdriven readonce
"... A very simple function that requires exponential size ..."
Parity graphdriven readonce branching programs and an exponential lower bound for integer multiplication
 In Proc. of 2nd TCS
, 2002
"... Abstract Branching programs are a wellestablished computation model for boolean functions, especially readonce branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic readonce branching programs are known for a long time. On the other hand ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
hand, the problem of proving superpolynomial lower bounds for parity readonce branching programs is still open. In this paper restricted parity readonce branching programs are considered and an exponential lower bound on the size of wellstructured parity graphdriven readonce branching programs
PARITY GRAPHDRIVEN READONCE BRANCHING PROGRAMS AND AN EXPONENTIAL LOWER BOUND FOR INTEGER MULTIPLICATION (Extended Abstract)
"... Branching programs are a wellestablished computation model for boolean functions, especially readonce branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic readonce branching programs are known for a long time. On the other hand, the pr ..."
Abstract
 Add to MetaCart
, the problem of proving superpolynomial lower bounds for parity readonce branching programs is still open. In this paper restricted parity readonce branching programs are considered and an exponential lower bound on the size of wellstructured parity graphdriven readonce branching programs for integer
Lower Bounds for the Sum of Graph–driven Read–Once Parity Branching Programs
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 68
, 2003
"... We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a challengin ..."
Abstract
 Add to MetaCart
≤ i ≤ k. This model that we call k–⊕BP1s for convenience strictly generalizes all restricted variants of read–once parity branching programs for that lower bounds are known. We consider a slightly more restricted version, i.e. the sum of k graph–driven ⊕BP1s with polynomial size graph– orderings. We
Lower Bounds for Restricted Read–Once Parity Branching Programs
, 2004
"... We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open ..."
Abstract
 Add to MetaCart
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open
On the Size of Randomized OBDDs and ReadOnce Branching Programs for kStable Functions
 In Proc. of the 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1563
, 1999
"... In this paper, a simple technique which unifies the known approaches for proving lower bound results on the size of deterministic, nondeterministic, and randomized OBDDs and kOBDDs is described. ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
In this paper, a simple technique which unifies the known approaches for proving lower bound results on the size of deterministic, nondeterministic, and randomized OBDDs and kOBDDs is described.
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing
No small nondeterministic readonce branching programs for CNFs of bounded treewidth
"... Abstract. In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primary graphs such that the equivalent nondeterministic readonce branching programs (NROBPs) are of size at least nck for some universal constant c. Thus we rule out the possibil ..."
Abstract
 Add to MetaCart
Abstract. In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primary graphs such that the equivalent nondeterministic readonce branching programs (NROBPs) are of size at least nck for some universal constant c. Thus we rule out
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2109 (30 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Results 1  10
of
336,030