Publications related to Methods of computing square roots

Non-linear matter power spectrum from Time Renormalisation Group: efficient computation and comparison with one-loop

We address the issue of computing the non-linear matter power spectrum on mildly non-linear scales with efficient semi-analytic methods. We implemented M. Pietroni's Time Renormalization Group (TRG) method and its Dynamical 1-Loop (D1L) limit in a numerica ...

2011

Localization of Point Sources for Systems Governed by the Wave Equation

Dimitri Nestor Alice Van De Ville, Thierry Blu, Ivana Jovanovic, Zafer Dogan, Vagia Tsiminaki

Analytic sensing has recently been proposed for source localization from boundary measurements using a generalization of the finite-rate-of-innovation framework. The method is tailored to the quasi-static electromagnetic approximation, which is commonly us ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

On the Convergence of EM-Like Algorithms for Image Segmentation using Markov Random Fields

Meritxell Bach Cuadra, Delphine Ribes Lemay, Gunnar Krüger, Alexis Roche

Inference of Markov random field images segmentation models is usually performed using iterative methods which adapt the well-known expectation-maximization (EM) algorithm for independent mixture models. However, some of these adaptations are ad-hoc and ma ...

2011

Transient Analysis of Adaptive Affine Combinations

Ali H. Sayed

In this correspondence, we provide a transient analysis of an affinely constrained mixture method that adaptively combines the outputs of adaptive filters running in parallel on the same task. The affinely constrained mixture is adapted using a stochastic ...

IEEE2011

Polar codes for the m-user multiple access channels

Rajai Nasser

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block length. Although the ...

2011

Estimation of Phase in Fringe Projection Technique Using High-order Instantaneous Moments Based Method

Pramod Rastogi, Sai Siva Gorthi

For three-dimensional (3D) shape measurement using fringe projection techniques, the information about the 3D shape of an object is encoded in the phase of a recorded fringe pattern. The paper proposes a high-order instantaneous moments based method to est ...

AIP Conf. Proc.2010

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower bound by Guha and ...

2010

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010

Polar codes: Characterization of exponent, bounds, and constructions

Rüdiger Urbanke, Satish Babu Korada, Eren Sasoglu

Polar codes were recently introduced by Arikan. They achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely rel ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Symmetric and non-symmetric discontinuous Galerkin methods stabilized using bubble enrichment

Erik Burman, Benjamin Stamm

In this Note we prove that in two and three space dimensions, the symmetric and non-symmetric discontinuous Galerkin method for second order elliptic problems is stable when using piecewise linear elements enriched with quadratic bubbles without any penali ...

2008

Methods of computing square roots

Graph Chatbot

Chat with Graph Search

Non-linear matter power spectrum from Time Renormalisation Group: efficient computation and comparison with one-loop

Localization of Point Sources for Systems Governed by the Wave Equation

On the Convergence of EM-Like Algorithms for Image Segmentation using Markov Random Fields

Transient Analysis of Adaptive Affine Combinations

Polar codes for the m-user multiple access channels

Estimation of Phase in Fringe Projection Technique Using High-order Instantaneous Moments Based Method

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Polar codes: Characterization of exponent, bounds, and constructions

Symmetric and non-symmetric discontinuous Galerkin methods stabilized using bubble enrichment

Non-linear matter power spectrum from Time Renormalisation Group: efficient computation and comparison with one-loop

Localization of Point Sources for Systems Governed by the Wave Equation

Transient Analysis of Adaptive Affine Combinations

On the Convergence of EM-Like Algorithms for Image Segmentation using Markov Random Fields

Polar codes for the m-user multiple access channels

Estimation of Phase in Fringe Projection Technique Using High-order Instantaneous Moments Based Method

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Symmetric and non-symmetric discontinuous Galerkin methods stabilized using bubble enrichment

Polar codes: Characterization of exponent, bounds, and constructions