Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,752
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract
-
Cited by 855 (68 self)
- Add to MetaCart
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes
Markov Logic Networks
- MACHINE LEARNING
, 2006
"... We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order 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
in the domain, it specifies a ground Markov network containing one feature for each possible grounding of a first-order formula in the KB, with the corresponding weight. Inference in MLNs is performed by MCMC over the minimal subset of the ground network required for answering the query. Weights are efficiently
Macroscopic strings as heavy quarks in large N gauge theory and Anti-de Sitter supergravity
- PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract
-
Cited by 508 (1 self)
- Add to MetaCart
Maldacena has put forward large N correspondence between superconformal field theories on the brane and anti-de Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3-brane and maximal supergravity on adS5 × S5 by introducing
Kodaira-Spencer theory of gravity and exact results for quantum string amplitudes
- Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract
-
Cited by 540 (59 self)
- Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Factoring wavelet transforms into lifting steps
- J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract
-
Cited by 584 (8 self)
- Add to MetaCart
. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is well-known to algebraists (and expressed by the formula); it is also used in linear systems theory in the electrical engineering community. We
Quantum complexity theory
- in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract
-
Cited by 574 (5 self)
- Add to MetaCart
–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can
An Analytic Derivation of the Cost of Deposit Insurance and Loan Guarantees: An Application of Modern Option Pricing Theory
- Journal of Banking and Finance
, 1977
"... It is not uncommon in the arrangement of a loan to include as part of the financial package a guarantee of the loan by a third party. Examples are guarantees by a parent company of loans made to its subsidiaries or government guarantees of loans made to private corporations. Also included would be g ..."
Abstract
-
Cited by 444 (6 self)
- Add to MetaCart
be guarantees of bank deposits by the Federal Deposit Insurance Corporation. As with other forms of insurance, the issuing of a guarantee imposes a liability or cost on the guarantor. In this paper, a formula is derived to evaluate this cost. The method used is to demonstrate an isomorphic correspondence
A hidden Markov model for predicting transmembrane helices in protein sequences
- In Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB
, 1998
"... A novel method to model and predict the location and orientation of alpha helices in membrane- spanning proteins is presented. It is based on a hidden Markov model (HMM) with an architecture that corresponds closely to the biological system. The model is cyclic with 7 types of states for helix core, ..."
Abstract
-
Cited by 373 (9 self)
- Add to MetaCart
, helix caps on either side, loop on the cytoplasmic side, two loops for the non-cytoplasmic side, and a globular domain state in the middle of each loop. The two loop paths on the non-cytoplasmic side are used to model short and long loops separately, which corresponds biologically to the two known
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
- Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one-to-one corresp ..."
Abstract
-
Cited by 260 (7 self)
- Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one
A Formulae-as-Types Notion of Control
- In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages
, 1990
"... The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with first-class labels and jumps. We show that the well-known formulae-astypes correspondence, which relates a constr ..."
Abstract
-
Cited by 294 (0 self)
- Add to MetaCart
The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with first-class labels and jumps. We show that the well-known formulae-astypes correspondence, which relates a
Results 1 - 10
of
11,752
