Results 1  10
of
2,225
Shape and motion from image streams under orthography: a factorization method
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1992
"... Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an illconditioned problem when the objects are distant with respect to their size. We have developed a factorization method that can overcome this difficulty by recovering shape and motion under orth ..."
Abstract

Cited by 1094 (38 self)
 Add to MetaCart
uses the singularvalue decomposition technique to factor the measurement matrix into two matrices which represent object shape and camera rotation respectively. Two of the three translation components are computed in a preprocessing stage. The method can also handle and obtain a full solution from a
Testing for Common Trends
 Journal of the American Statistical Association
, 1988
"... Cointegrated multiple time series share at least one common trend. Two tests are developed for the number of common stochastic trends (i.e., for the order of cointegration) in a multiple time series with and without drift. Both tests involve the roots of the ordinary least squares coefficient matrix ..."
Abstract

Cited by 464 (7 self)
 Add to MetaCart
matrix obtained by regressing the series onto its first lag. Critical values for the tests are tabulated, and their power is examined in a Monte Carlo study. Economic time series are often modeled as having a unit root in their autoregressive representation, or (equivalently) as containing a stochastic
Maximal and premaximal paraconsistency in the framework of threevalued semantics
 STUDIA LOGICA,
, 2011
"... Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
it in the context of logics that are based on deterministic or nondeterministic threevalued matrices. We show that all reasonable paraconsistent logics based on threevalued deterministic matrices are maximal in our strong sense. This applies to practically all threevalued paraconsistent logics that have been
Nondeterministic Semantics for Logics with a Consistency Operator
 IN THE INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
, 2006
"... In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s appr ..."
Abstract

Cited by 24 (15 self)
 Add to MetaCart
semantics for 64 of the most important logics from this family. Our semantics is 3valued for some of the systems, and infinitevalued for the others. We prove that these results cannot be improved: neither of the systems with a threevalued nondeterministic semantics has either a finite characteristic
Nondeterministic combination of connectives
, 2011
"... Combined connectives arise when combining logics [12] and are also useful for analyzing the common properties of two connectives within a given logic [11]. A nondeterministic semantics and a Hilbert calculus are proposed for the meetcombination of connectives (and other language constructors) of a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Combined connectives arise when combining logics [12] and are also useful for analyzing the common properties of two connectives within a given logic [11]. A nondeterministic semantics and a Hilbert calculus are proposed for the meetcombination of connectives (and other language constructors
NonDeterministic Matrices
 in Proceedings of the 34th IEEE International Symposium on MultipleValued Logic (ISMVL 2004), 282287, IEEE Computer
, 2000
"... We generalize the ordinary concept of a matrix by introducing nondeterministic matrices (Nmatrices). We show that some important logics for reasoning under uncertainty can be characterized by nite Nmatrices (and so they are decidable) although they have only innite characteristic matrices. We pro ..."
Abstract
 Add to MetaCart
We generalize the ordinary concept of a matrix by introducing nondeterministic matrices (Nmatrices). We show that some important logics for reasoning under uncertainty can be characterized by nite Nmatrices (and so they are decidable) although they have only innite characteristic matrices. We
Maximally paraconsistent threevalued logics
 Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning (KR’10
, 2010
"... Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
it in the context of logics that are based on deterministic or nondeterministic threevalued matrices. We first show that most of the logics that are based on properly nondeterministic threevalued matrices are not maximally paraconsistent. Then we show that in contrast, in the deterministic case all the natural
Nondeterministic Multivalued Structures
 Journal of Logic and Computation
, 2005
"... In this paper the concept of a multivalued nondeterministic (propositional) matrix, in which nondeterministic computations of truth values are allowed, is extended to languages with quantifiers. We describe the difficulties involved in applying the two main classical approaches to interpreting quan ..."
Abstract

Cited by 26 (20 self)
 Add to MetaCart
In this paper the concept of a multivalued nondeterministic (propositional) matrix, in which nondeterministic computations of truth values are allowed, is extended to languages with quantifiers. We describe the difficulties involved in applying the two main classical approaches to interpreting
Nondeterministic Communication Complexity with Few Witnesses
, 1994
"... We study nondeterministic communication protocols in which no input has too many witnesses. Define n k (f) to be the minimum complexity of a nondeterministic protocol for the function f in which each input has at most k witnesses. We present two different lower bounds for n k (f). Our first result ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We study nondeterministic communication protocols in which no input has too many witnesses. Define n k (f) to be the minimum complexity of a nondeterministic protocol for the function f in which each input has at most k witnesses. We present two different lower bounds for n k (f). Our first
Strong CutElimination, Coherence, and Nondeterministic Semantics
, 2007
"... An (n, k)ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)ary quantifiers form a natural class of Gentzentype systems which in addition to the standard axioms and structural rules have only logical rules in which exac ..."
Abstract
 Add to MetaCart
exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using twovalued nondeterministic matrices, a generalization of the classical matrix. In this paper we use a constructive syntactic criterion of coherence to characterize strong cut
Results 1  10
of
2,225