Results 1  10
of
1,301,513
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
consider a class of Modified Information Criteria (MIC) with a penalty factor that is sample dependent. It takes into account the fact that the bias in the sum of the autoregressive coefficients is highly dependent on k and adapts to the type of deterministic components present. We use a local asymptotic
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Comments on Noncommutative ADHM Construction
, 2002
"... We extend the method of matrix partition to obtain explicitly the gauge field for noncommutative ADHM construction in some general cases. As an application of this method we apply it to the U(2) 2instanton and get explicit result for In a previous paper [1], we studied the U(1) and U(2) instanton s ..."
Abstract
 Add to MetaCart
We extend the method of matrix partition to obtain explicitly the gauge field for noncommutative ADHM construction in some general cases. As an application of this method we apply it to the U(2) 2instanton and get explicit result for In a previous paper [1], we studied the U(1) and U(2) instanton
Fully homomorphic encryption using ideal lattices
 In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract

Cited by 664 (17 self)
 Add to MetaCart
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation
ADHM is tachyon condensation
 JHEP
, 2006
"... We study the fuzzy or noncommutative Dpbranes in terms of infinitely many unstable D0branes, from which we can construct any Dpbranes. We show that the tachyon condensation of the unstable D0branes induces the noncommutativity. In the infinite tachyon condensation limit, most of the unstable D0 ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We study the fuzzy or noncommutative Dpbranes in terms of infinitely many unstable D0branes, from which we can construct any Dpbranes. We show that the tachyon condensation of the unstable D0branes induces the noncommutativity. In the infinite tachyon condensation limit, most of the unstable D0
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 415 (38 self)
 Add to MetaCart
In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order
The ADHM Construction and . . .
, 20008
"... We consider the action on instanton moduli spaces of the nonlocal symmetries of the selfdual YangMills equations on R 4 discovered by Chau and coauthors. Beginning with the ADHM construction, we show that a subalgebra of the symmetry algebra generates the tangent space to the instanton moduli sp ..."
Abstract
 Add to MetaCart
We consider the action on instanton moduli spaces of the nonlocal symmetries of the selfdual YangMills equations on R 4 discovered by Chau and coauthors. Beginning with the ADHM construction, we show that a subalgebra of the symmetry algebra generates the tangent space to the instanton moduli
Connectionist Learning Procedures
 ARTIFICIAL INTELLIGENCE
, 1989
"... A major goal of research on networks of neuronlike processing units is to discover efficient learning procedures that allow these networks to construct complex internal representations of their environment. The learning procedures must be capable of modifying the connection strengths in such a way ..."
Abstract

Cited by 409 (9 self)
 Add to MetaCart
A major goal of research on networks of neuronlike processing units is to discover efficient learning procedures that allow these networks to construct complex internal representations of their environment. The learning procedures must be capable of modifying the connection strengths in such a way
Arcing Classifiers
, 1998
"... Recent work has shown that combining multiple versions of unstable classifiers such as trees or neural nets results in reduced test set error. One of the more effective is bagging (Breiman [1996a] ) Here, modified training sets are formed by resampling from the original training set, classifiers con ..."
Abstract

Cited by 344 (6 self)
 Add to MetaCart
Recent work has shown that combining multiple versions of unstable classifiers such as trees or neural nets results in reduced test set error. One of the more effective is bagging (Breiman [1996a] ) Here, modified training sets are formed by resampling from the original training set, classifiers
Results 1  10
of
1,301,513