Results 1  10
of
733
The Effects of an Arcsin Square Root Transform on a Binomial Distributed Quantity
"... This document provides proofs of the following: • The binomial distribution can be approximated with a Gaussian distribution at large values of N. • The arcsin squareroot transform is the variance stabilising transform for the binomial distribution. • The Gaussian approximation for the binomial dis ..."
Abstract
 Add to MetaCart
This document provides proofs of the following: • The binomial distribution can be approximated with a Gaussian distribution at large values of N. • The arcsin squareroot transform is the variance stabilising transform for the binomial distribution. • The Gaussian approximation for the binomial
Categorical Data Analysis: Away from ANOVAs (transformation or not) and towards Logit Mixed Models
"... This paper identifies several serious problems with the widespread use of ANOVAs for the analysis of categorical outcome variables such as forcedchoice variables, questionanswer accuracy, choice in production (e.g. in syntactic priming research), et cetera. I show that even after applying the arc ..."
Abstract

Cited by 252 (7 self)
 Add to MetaCart
the arcsinesquareroot transformation to proportional data, ANOVA can yield spurious results. I discuss conceptual issues underlying these problems and alternatives provided by modern statistics. Specifically, I introduce ordinary logit models (i.e. logistic regression), which are wellsuited to analyze
Ensemble Square Root Filters
, 2003
"... Ensemble data assimilation methods assimilate observations using statespace estimation methods and lowrank representations of forecast and analysis error covariances. A key element of such methods is the transformation of the forecast ensemble into an analysis ensemble with appropriate statistics ..."
Abstract

Cited by 120 (8 self)
 Add to MetaCart
of Kalman square root filters. The nonuniqueness of the deterministic transformation used in square root Kalman filters provides a framework to compare three recently proposed ensemble data assimilation methods.
An Efficient SquareRoot Algorithm for BLAST
 IEEE Trans. Sig. Proc
, 2000
"... Bell Labs Layered SpaceTime (BLAST) is a scheme for transmitting information over a richscattering wireless environment using multiple receive and transmit antennas. The main computational bottleneck in the BLAST algorithm is a "nulling and cancelation" step, where the optimal ordering f ..."
Abstract

Cited by 119 (9 self)
 Add to MetaCart
for the sequential estimation and detection of the received signals is determined. To reduce the computational cost of BLAST, in this paper we develop an efficient squareroot algorithm for the nulling and cancellation step. The main features of the algorithm include efficiency: the computational cost is reduced
Stochastic Volatility for Lévy Processes
, 2001
"... Three processes re°ecting persistence of volatility are initially formulated by evaluating three L¶evy processes at a time change given by the integral of a mean reverting square root process. The model for the mean reverting time change is then generalized to include NonGaussian models that are so ..."
Abstract

Cited by 209 (12 self)
 Add to MetaCart
Three processes re°ecting persistence of volatility are initially formulated by evaluating three L¶evy processes at a time change given by the integral of a mean reverting square root process. The model for the mean reverting time change is then generalized to include NonGaussian models
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
from pixel to pixel and there is noise correlation between pixels. For similar reasons the noise level does not have the common squareroot dependence on the number of samples taken. In the case of Cartesian sampling with reconstruction as initially explained, this can be made yet clearer. For one
Square root and division elimination in PVS
"... Abstract. In this paper we present a new strategy for PVS that implements a square root and division elimination in order to use automatic arithmetic strategies that were not able to deal with these operations in a first place. This strategy relies on a PVS formalization of the square root and divi ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
and division elimination and deep embedding of PVS expressions inside PVS. Therefore using computational reflection and symbolic computation we are able to automatically transform expressions into division and square root free ones before using these decisions procedures.
Computable elastic distances between shapes
 SIAM J. Appl. Math
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 145 (19 self)
 Add to MetaCart
JSTOR, please contact support@jstor.org. . Society for Industrial and Applied Mathematics COMPUTABLE ELASTIC DISTANCES BETWEEN SHAPES* LAURENT YOUNESt Abstract. We define distances between geometric curves by the square root of the minimal energy required to transform one curve into the other
Removing shapepreserving transformations in squareroot elastic (sre) framework for shape analysis of curves
 In EMMCVPR’07
, 2007
"... Abstract. This paper illustrates and extends an efficient framework, called the squarerootelastic (SRE) framework, for studying shapes of closed curves, that was first introduced in [2]. This framework combines the strengths of two important ideas elastic shape metric and pathstraightening metho ..."
Abstract

Cited by 30 (9 self)
 Add to MetaCart
Abstract. This paper illustrates and extends an efficient framework, called the squarerootelastic (SRE) framework, for studying shapes of closed curves, that was first introduced in [2]. This framework combines the strengths of two important ideas elastic shape metric and path
Elimination of Square Roots and Divisions by Partial Inlining
"... Computing accurately with real numbers is always a challenge. This is particularly true in critical embedded systems since memory issues do not allow the use of dynamic data structures. This constraint imposes a finite representations of the real numbers, provoking uncertainties and rounding error ..."
Abstract
 Add to MetaCart
errors that might modify the actual behavior of a program from its ideal one. This article presents a solution to this problem with a program transformation that eliminates square roots and divisions in straight line programs without nested function calls. These two operations are the source of infi
Results 1  10
of
733