Results 1  10
of
230,713
Combinatorial characterization of readonce formulae
, 2002
"... We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called ReadOnce. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results of Seymo ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called ReadOnce. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results
Learning ReadOnce Formulas with Queries
 J. ACM
, 1989
"... A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time al ..."
Abstract

Cited by 117 (19 self)
 Add to MetaCart
A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
An Empirical Characterization of the Dynamic Effects of changes in Government Spending and Taxes on Output
 QUARTERLY JOURNAL OF ECONOMICS
, 2002
"... This paper characterizes the dynamic effects of shocks in government spending and taxes on U. S. activity in the postwar period. It does so by using a mixed structural VAR/event study approach. Identification is achieved by using institutional information about the tax and transfer systems to identi ..."
Abstract

Cited by 650 (11 self)
 Add to MetaCart
This paper characterizes the dynamic effects of shocks in government spending and taxes on U. S. activity in the postwar period. It does so by using a mixed structural VAR/event study approach. Identification is achieved by using institutional information about the tax and transfer systems
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
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 Functions that are ReadOnce on a Subset of their Inputs
"... Amonotone boolean function f: { 0,1} V → { 0,1} is readonce if f can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. V. Gurvich (and independently Karchmer, Linial, Newman, Saks, and Wigderson) proved anecessary and sufficient condition fo ..."
Abstract
 Add to MetaCart
Amonotone boolean function f: { 0,1} V → { 0,1} is readonce if f can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. V. Gurvich (and independently Karchmer, Linial, Newman, Saks, and Wigderson) proved anecessary and sufficient condition
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
fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances — including the key problems of computing marginals and modes
Pseudorandomness for multilinear readonce algebraic branching programs
 in any order. Electronic Colloquium on Computational Complexity (ECCC
"... We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model. F ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Results 1  10
of
230,713