Results 1  10
of
5,249
Markov Logic Networks
 MACHINE LEARNING
, 2006
"... We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract

Cited by 816 (39 self)
 Add to MetaCart
We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 620 (53 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
JEFFREYKIRWANWITTEN LOCALIZATION FORMULA FOR REDUCTIONS AT REGULAR COADJOINT ORBITS
"... For MarsdenWeinstein reduction at the point 0 in g∗, the wellknown JeffreyKirwanWitten localization formula was proven and then by M. Vergne modified. We prove in this paper the same kind formula for the reduction at regular coadjoint orbits by using the universal orbital formula of characters ..."
Abstract
 Add to MetaCart
For MarsdenWeinstein reduction at the point 0 in g∗, the wellknown JeffreyKirwanWitten localization formula was proven and then by M. Vergne modified. We prove in this paper the same kind formula for the reduction at regular coadjoint orbits by using the universal orbital formula
JEFFREYKIRWANWITTEN LOCALIZATION FORMULA FOR REDUCTIONS AT REGULAR COADJOINT ORBITS
, 1998
"... Abstract. For MarsdenWeinstein reduction at the point 0 in g ∗ , the wellknown JeffreyKirwanWitten localization formula was proven and then by M. Vergne modified. We prove in this paper the same kind formula for the reduction at regular coadjoint orbits by using the universal orbital formula of ..."
Abstract
 Add to MetaCart
Abstract. For MarsdenWeinstein reduction at the point 0 in g ∗ , the wellknown JeffreyKirwanWitten localization formula was proven and then by M. Vergne modified. We prove in this paper the same kind formula for the reduction at regular coadjoint orbits by using the universal orbital formula
Quantum Circuit Complexity
, 1993
"... We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomialsize quantum circuit. This result also enables us to construct a universal quantum compu ..."
Abstract

Cited by 320 (1 self)
 Add to MetaCart
We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomialsize quantum circuit. This result also enables us to construct a universal quantum
Evaluating 2dnf formulas on ciphertexts
 In proceedings of TCC ’05, LNCS series
, 2005
"... Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create th ..."
Abstract

Cited by 231 (7 self)
 Add to MetaCart
Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create
Critical Behavior in the Satisfiability of Random Boolean Formulae
 Science
, 1994
"... The satisfiability of randomly generated Boolean formulae with k variables per clause is a popular testbed for the performance of search algorithms in artificial intelligence and computer science. For k = 2, formulae are almost aways satisfiable when the ratio of clauses to variables is less than ..."
Abstract

Cited by 179 (11 self)
 Add to MetaCart
The satisfiability of randomly generated Boolean formulae with k variables per clause is a popular testbed for the performance of search algorithms in artificial intelligence and computer science. For k = 2, formulae are almost aways satisfiable when the ratio of clauses to variables is less
Which Problems Have Strongly Exponential Complexity?
 Journal of Computer and System Sciences
, 1998
"... For several NPcomplete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of subexponential algorithms for these problems. We introduce a generalized reduction which we call SubExponential Reduction Family (SERF) t ..."
Abstract

Cited by 242 (11 self)
 Add to MetaCart
formulas whose first order part is universal. In particular, subexponential complexity for any one of the above problems implies the same for all others. We also look at the issue of proving strongly exponential lower bounds for AC 0 ; that is, bounds of the form 2 \Omega\Gamma n) . This problem
A "universal" Construction Of Artstein's Theorem On Nonlinear Stabilization
 Systems & Control Letters
, 1989
"... This note presents an explicit proof of the theorem due to Artstein which states that the existence of a smooth controlLyapunov function implies smooth stabilizability. Moreover, the result is extended to the realanalytic and rational cases as well. The proof uses a "universal" formu ..."
Abstract

Cited by 177 (17 self)
 Add to MetaCart
This note presents an explicit proof of the theorem due to Artstein which states that the existence of a smooth controlLyapunov function implies smooth stabilizability. Moreover, the result is extended to the realanalytic and rational cases as well. The proof uses a "universal
A Universal Density Profile from Hierarchical Clustering
 The Cluster MT Relation 6 Temperature Profiles Observed with ASCA and ROSAT. ApJ
, 1997
"... We use highresolution Nbody simulations to study the equilibrium density profiles of dark matter halos in hierarchically clustering universes. We find that all such profiles have the same shape, independent of halo mass, of initial density fluctuation spectrum, and of the values of the cosmologica ..."
Abstract

Cited by 159 (1 self)
 Add to MetaCart
of the cosmological parameters. Spherically averaged equilibrium profiles are well fit over two decades in radius by a simple formula originally proposed to describe the structure of galaxy clusters in a cold dark matter universe. In any particular cosmology the two scale parameters of the fit, the halo mass and its
Results 1  10
of
5,249