Results 1  10
of
1,092,647
Completeness of Resolution for Definite Answers
 Journal of Logic and Computation
, 1994
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite substit ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite
Completeness of Resolution for Definite Answers Tanel Tammet
 Journal of Logic and Computation
, 1995
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite substit ..."
Abstract
 Add to MetaCart
We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite
Completeness of Resolution for Definite Answers Tanel Tammet
 Journal of Logic and Computation
, 1995
"... We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite subs ..."
Abstract
 Add to MetaCart
We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical firstorder predicate logic. The Aresolution calculus based on the program derivation algorithm A of CL. Chang, R. CT. Lee and R.Waldinger is used for finding a definite
Answering the Skeptics: Yes, Standard Volatility Models Do Provide Accurate Forecasts
"... Volatility permeates modern financial theories and decision making processes. As such, accurate measures and good forecasts of future volatility are critical for the implementation and evaluation of asset and derivative pricing theories as well as trading and hedging strategies. In response to this, ..."
Abstract

Cited by 553 (47 self)
 Add to MetaCart
Volatility permeates modern financial theories and decision making processes. As such, accurate measures and good forecasts of future volatility are critical for the implementation and evaluation of asset and derivative pricing theories as well as trading and hedging strategies. In response to this, a voluminous literature has emerged for modeling the temporal dependencies in financial market volatility at the daily and lower frequencies using ARCH and stochastic volatility type models. Most of these studies find highly significant insample parameter estimates and pronounced intertemporal volatility persistence. Meanwhile, when judged by standard forecast evaluation criteria, based on the squared or absolute returns over daily or longer forecast horizons, standard volatility models provide seemingly poor forecasts. The present paper demonstrates that, contrary to this contention, in empirically realistic situations the models actually produce strikingly accurate interdaily forecasts f...
preeclampsia—a step forward but not the definitive answer
"... Dysregulation of antiangiogenic agents (sFlt1, PLGF, and sEndoglin) in ..."
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Motivation Definitions Answer Sketch Problem Summary Topological types Definition
, 2007
"... Homogeneity of topological spaces ..."
A classification and comparison framework for software architecture description languages
 IEEE Transactions on Software Engineering
, 2000
"... Software architectures shift the focus of developers from linesofcode to coarsergrained architectural elements and their overall interconnection structure. Architecture description languages (ADLs) have been proposed as modeling notations to support architecturebased development. There is, howev ..."
Abstract

Cited by 840 (59 self)
 Add to MetaCart
, module interconnection, simulation, and programming languages on the other. This paper attempts to provide an answer to these questions. It motivates and presents a definition and a classification framework for ADLs. The utility of the definition is demonstrated by using it to differentiate ADLs from
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
leads to a NewtonRaphson style minimization. In this report, after rederiving the method in a physically intuitive way, we answer the crucial question of how to choose the feature windows that are best suited for tracking. Our selection criterion is based directly on the definition of the tracking
Results 1  10
of
1,092,647