Results 1  10
of
665,527
Lag length selection and the construction of unit root tests with good size and power
 Econometrica
, 2001
"... It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We conside ..."
Abstract

Cited by 557 (14 self)
 Add to MetaCart
It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike 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 854 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1012 (7 self)
 Add to MetaCart
square root of y, if it exists, would be the program x := 0 ; while x < y do x := x + 1: (1) In DL, such programs are firstclass objects on a par with formulas, complete with a collection of operators for forming compound programs inductively from a basis of primitive programs. To discuss
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 615 (2 self)
 Add to MetaCart
A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
nothing directly to do with coding or decoding will show that in some sense belief propagation "converges with high probability to a nearoptimum value" of the desired belief on a class of loopy DAGs Progress in the analysis of loopy belief propagation has been made for the case of networks
Debugging Unsatisfiable Classes in OWL
"... As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors becomes an extremely hard task even for experts. Existing ontology development environments provide some limited support ..."
Abstract
 Add to MetaCart
occurs (e.g., by pinpointing the root clash, or axioms in the ontology responsible for the clash) or how dependencies between classes cause the error to propagate (i.e., by distinguishing root from derived unsatisfiable classes). In the former case, information from the internals of a description logic
Common Persistence in Conditional Variances
 ECONOMETRIC REVIEWS
, 1993
"... Since the introduction of the autoregressive conditional heteroskedastic (ARCH) model in Engle (1982), numerous applications of this modeling strategy have already appeared. A common finding in many of these studies with high frequency financial or monetary data concerns the presence of an approxima ..."
Abstract

Cited by 343 (20 self)
 Add to MetaCart
of an approximate unit root in the autoregressive polynomial in the univariate time series representation for the conditional second order moments of the process, as in the socalled integrated generalized ARCH (IGARCH) class of models proposed in Engle and Bollerslev (1986). In the IGARCH models shocks
How to Prove Unsatisfiability by Homomorphisms
, 2000
"... We define homomorphisms of boolean formulas in conjunctive normal form such that, if # : F # # F is a homomorphism, then the unsatisfiability of F # implies the unsatisfiability of F . MU(1) denotes the class of minimal unsatisfiable formulas which have exactly one more clause than variables; it i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We define homomorphisms of boolean formulas in conjunctive normal form such that, if # : F # # F is a homomorphism, then the unsatisfiability of F # implies the unsatisfiability of F . MU(1) denotes the class of minimal unsatisfiable formulas which have exactly one more clause than variables
Repairing Unsatisfiable Concepts in OWL
"... Abstract. In this paper, we investigate the problem of repairing unsatisfiable concepts in an OWL ontology in detail, keeping in mind the user perspective as much as possible. We focus on various aspects of the repair process – improving the explanation support to help the user understand the cause ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we investigate the problem of repairing unsatisfiable concepts in an OWL ontology in detail, keeping in mind the user perspective as much as possible. We focus on various aspects of the repair process – improving the explanation support to help the user understand the cause
Minimally Unsatisfiable Subformulae
"... Minimal unsatisfiability is a topic in the field of satisfiability (SAT). Minimally unsatisfiable subformulae (MUSes) are minimal subsets of an unsatisfiable formula that are unsatisfiable. They can therefore be seen as causes of unsatisfiability. With recent improvements in SAT solving, extractingM ..."
Abstract
 Add to MetaCart
Minimal unsatisfiability is a topic in the field of satisfiability (SAT). Minimally unsatisfiable subformulae (MUSes) are minimal subsets of an unsatisfiable formula that are unsatisfiable. They can therefore be seen as causes of unsatisfiability. With recent improvements in SAT solving, extracting
Results 1  10
of
665,527