Results 1  10
of
3,317
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 558 (14 self)
 Add to MetaCart
(1996). We also extend the M tests developed in Perron and Ng (1996) to allow for GLS detrending of the data. The MIC along with GLS detrended data yield a set of tests with desirable size and power properties.
Fast MonteCarlo algorithms for finding lowrank approximations
 IN PROCEEDINGS OF THE 39TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1998
"... We consider the problem of approximating a given m * n matrix A by another matrix of specified rank k, which is smaller than m and n. The Singular Value Decomposition (SVD) can be used to find the "best " such approximation. However, it takes time polynomial in m, n which is prohib ..."
Abstract

Cited by 237 (16 self)
 Add to MetaCart
We consider the problem of approximating a given m * n matrix A by another matrix of specified rank k, which is smaller than m and n. The Singular Value Decomposition (SVD) can be used to find the "best " such approximation. However, it takes time polynomial in m, n which
Fast Monte Carlo Algorithms for Matrices II: Computing a LowRank Approximation to a Matrix
 SIAM JOURNAL ON COMPUTING
, 2004
"... ... matrix A. It is often of interest to find a lowrank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the Singular Value Decomposition (SVD) may be used to find an approximation to A ..."
Abstract

Cited by 216 (20 self)
 Add to MetaCart
... matrix A. It is often of interest to find a lowrank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the Singular Value Decomposition (SVD) may be used to find an approximation
Efficient topk query evaluation on probabilistic data
 in ICDE
, 2007
"... Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query evaluation on probabilistic databases is difficult: previous approaches have either restricted the SQL queries, or computed ..."
Abstract

Cited by 182 (32 self)
 Add to MetaCart
, since imprecisions in the data often lead to a large number of answers of low quality, and users are interested only in the answers with the highest probabilities. The idea in our algorithm is to run in parallel several MonteCarlo simulations, one for each candidate answer, and approximate each
Path coupling: A technique for proving rapid mixing in Markov chains
 IN FOCS ’97: PROCEEDINGS OF THE 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS
, 1997
"... The main technique used in algorithm design for approximating #Phard counting problems is the Markov chain Monte Carlo method. At the heart of the method is the study of the convergence (mixing) rates of particular Markov chains of interest. In this paper we illustrate a new approach to the couplin ..."
Abstract

Cited by 175 (20 self)
 Add to MetaCart
The main technique used in algorithm design for approximating #Phard counting problems is the Markov chain Monte Carlo method. At the heart of the method is the study of the convergence (mixing) rates of particular Markov chains of interest. In this paper we illustrate a new approach
Viviane Moreira de Camargo, Barbara do Carmo dos Santos Martins, Carlos Jardim,
"... Validation of a treadmill sixminute walk test protocol for the evaluation of patients with pulmonary arterial hypertension* Validação de um protocolo para o teste de caminhada de seis minutos em esteira para avaliação de pacientes com hipertensão arterial pulmonar ..."
Abstract
 Add to MetaCart
Validation of a treadmill sixminute walk test protocol for the evaluation of patients with pulmonary arterial hypertension* Validação de um protocolo para o teste de caminhada de seis minutos em esteira para avaliação de pacientes com hipertensão arterial pulmonar
Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks
 Bioinformatics
, 2003
"... Motivation: Bayesian networks have been applied to infer genetic regulatory interactions from microarray gene expression data. This inference problem is particularly hard in that interactions between hundreds of genes have to be learned from very small data sets, typically containing only a few doze ..."
Abstract

Cited by 174 (5 self)
 Add to MetaCart
are simulated from a realistic biological network involving DNAs, mRNAs, inactive protein monomers and active protein dimers. Then, interaction networks are inferred from these data in a reverse engineering approach, using Bayesian networks and Bayesian learning with Markov chain Monte Carlo.
Results
Sandra Batista dos Santos 1
"... Mycoplasmas were searched in the ear canal flushing of 60 bovine in Brazil. The prevalence obtained was 80%. The percentages of typified species were 12.5%, for M. alkalenses; 2.1%, M. arginini; 8.35%, M. ..."
Abstract
 Add to MetaCart
Mycoplasmas were searched in the ear canal flushing of 60 bovine in Brazil. The prevalence obtained was 80%. The percentages of typified species were 12.5%, for M. alkalenses; 2.1%, M. arginini; 8.35%, M.
Valdirene Alves dos SANTOS(a)
"... Antifungal effect of electrospun nanofibers containing cetylpyridinium chloride against Candida albicans Abstract: It is known that cetylpyridinium chloride (CPC) has in vitro and in vivo antifungal action against Candida albicans, with advantages over other common antiseptics. A CPC deliverycontro ..."
Abstract
 Add to MetaCart
Antifungal effect of electrospun nanofibers containing cetylpyridinium chloride against Candida albicans Abstract: It is known that cetylpyridinium chloride (CPC) has in vitro and in vivo antifungal action against Candida albicans, with advantages over other common antiseptics. A CPC delivery
A. LimaSantos Universidade Federal de São Carlos
"... The graded reflection equation is investigated for the Uq[osp(r2m) (1)] vertex model. We have found four classes of diagonal solutions with at the most one free parameter and twelve classes of nondiagonal ones with the number of free parameters depending on the number of bosonic (r) and fermionic ..."
Abstract
 Add to MetaCart
The graded reflection equation is investigated for the Uq[osp(r2m) (1)] vertex model. We have found four classes of diagonal solutions with at the most one free parameter and twelve classes of nondiagonal ones with the number of free parameters depending on the number of bosonic (r) and fermionic
Results 1  10
of
3,317