Fast computation
Fast computation of all pairs of geodesic distances
... INTRODUCTION OF NEW METHODS FOR FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES In the current section, we initially present Bertelli et al. (2006) method, named the “spiral method”, and then we ...
11
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
... In the past decade, a number of algorithms have been reported in the literature for fast computation of DWT or GDHT. For example, Bi [2] developed radix-type algorithms for efficiently computing the ...
9
Radio morphing - towards a fast computation of the radio signal from air-showers
... 10448, 63000 Clermond-Ferrand, France Abstract. Over the last decades, radio detection of air showers has been established as a promising detection technique for ultrahigh-energy cosmic rays and neutrinos. Very large or ...
4
Radix-3 Algorithm for the Fast Computation of Forward and Inverse MDCT
... and a short block , we present in this letter a radix-3 algorithm for efficiently computing the MDCT and IMDCT for data sequences with length , where is a positive integer. Such a strategy was recently adopted by Chan ...
5
Fast Computation of the $N$-th Term of a $q$-Holonomic Sequence and Applications
... the fast computation of matrix q-factorials is the computation of curvatures of q-difference equations, since in this area these objects appear quite ...p-curvatures fast [32–34, ...
34
Fast Computation of Sliding Discrete Tchebichef Moments and Its Application in Duplicated Regions Detection
... Index Terms: Tchebichef moments, sliding transform, fast computation, duplicated signal detection I. INTRODUCTION Tchebichef moments or transforms were first introduced by Mukundan et al. [1]. Since the ...
20
Fast computation of Tchebichef moments for binary and grayscale images.
... on-line computation is ...for fast computation of the two-dimensional Tchebichef ...a fast algorithm is proposed for computing the moments of binary and gray-scale ...
17
Improved Radix-3 Decimation-in-Frequency Algorithm for the Fast Computation of Forward and Inverse MDCT
... 4 Centre de Recherche en Information Biomédicale Sino-français (CRIBs), Rennes, France Abstract Shu et al. recently proposed an efficient radix-3 decimation-in-Frequency (DIF) algorithm for the fast ...
6
Radio Morphing: towards a fast computation of the radio signal from air showers
... the computation of the emitted radio signal called Radio ...standard computation methods, but with computation times reduced by several orders of ...
16
Fast computation of minimum hybridization networks
... While some papers in the literature have focused on reconciling incongruent gene phylogenies in terms of a network (Koblmuller et al., 2007), a major problem has been the lack of software implementing an algorithm for ...
8
Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition
... Contribution with respect to the state of the art. In Dumas et al. ( 2013 ) we proposed a first Gaussian elimination algorithm, with a recursive splitting of both row and col- umn dimensions, which simultaneously ...
31
Fast Computation with Two Algebraic Numbers
... Unité de recherche INRIA Rocquencourt Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois -[r] ...
26
Measure of circularity for parts of digital boundaries and its fast computation
... [17] V. A. Kovalevsky, New definition and fast recognition of digital straight segments and arcs, in: Internation Conference on Pattern Analysis and Machine Intelligence, 1990, pp. 31–34. [18] S. Pham, Digital ...
43
Fast computation of magnetostatic fields by Non-uniform Fast Fourier Transforms
... N 4/3 in 3D). In this Letter we report the implementation of a new magnetostatic code which combines the advantages of both cited approaches : it uses a FEM mesh thus de- scribing curved boundaries as well as FEM-BEM, ...
5
Fast computation and applications of genome mappability.
... There are two algorithmic issues, however. The first one is that most of the available mappers are not based on exhaustive alignment algorithms; this fact implies that they are unable to report the exact count of all the ...
16
Fast computation of class fields given their norm group
... Proof: The proof is now obvious. We compute the norm group once for each α at step 13. Thanks to D we take care to study only linearly in- dependent vectors in G ∗ . This makes dK computations of norm groups. If ` 6= 2, ...
9
Fast computation of some asymptotic functional inverses
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
12
Fast computation of the leastcore and prenucleolus of cooperative games
... Unité de recherche INRIA Rocquencourt Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex France Unité de recherche INRIA Futurs : Parc Club Orsay Université - ZAC des V[r] ...
16
Robust and fast computation of edge characteristics in image sequences
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
52
Fast algorithms for the computation of sliding sequency-ordered complex Hadamard transform
... the fast computation of sliding WHT [20-24] due to the real-time application requirement of pattern matching in many cases, such as video block motion estimation in ...A fast algorithm, based on the ...
10