fast computation
Fast Computation of the Shortest Path Problem through Simultaneous Forward and Backward Systolic Dynamic Programming
... The operation of the proposed system is clarified by the following example with the aid of Figures 5 through 7. Figures 5 and 6 demonstrate a seven-stage DAG with weighted edges. The middle stage is S4 which is shown in ...
5
Fast Computation of Dipole Radiation in Stratified Background Using Graphics Processing Unit
... Simulations play an important role in research environment, in order to predict or explain physical phenomena. However, simulations may sometimes require very large memory and time in computation. This is ...
12
Event count distributions from renewal processes : fast computation of probabilities
... Convolution can be done directly, or via taking the Laplace or Fourier transform of the prob- ability density function (pdf) of the survival distribution and inverting the result. The drawback of directly doing ...
20
Fast computation of electromagnetic near-fields with the multilevel fast multipole method combining near-field and far-field translations
... lems, computation of electromagnetic near-fields in the vicinity of complex radiation and scattering systems is of- ten ...by fast IE solvers such as the Multilevel Fast Multipole Method ...known. ...
5
Improvements on ORCA for Fast Computation of Graphlet Degree Vectors of any Graphlet Order
... the computation of extension sets using fixed-point automorphisms, which we describe in Section ...the computation of the matrix on the left-hand side of the triangular linear ...
34
Fast computation of the nonlocal boundary condition in finite difference parabolic equation radiowave propagation simulations
... computation time and memory efficient method for modelling electrically large radiowave propagation problems in which the effect of backward waves can be ignored is the Finite Difference Parabolic Equation Method ...
9
Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem
... of computation of the Pareto set we consider the pig diet formulation problem taking into account not only the cost of the diet but also environmental considerations, such as the reduction of nitrogen or ...
20
Compound Means and Fast Computation of Radicals
... Newton’s method is a general method for numerical solution of equations and for particular choice of the equation it can lead to useful algorithms, for example to algorithm for division [r] ...
26
Fast Computation of Lexical Affinity Models
... We present a framework for the fast compu- tation of lexical affinity models. The frame- work is composed of a novel algorithm to effi- ciently compute the co-occurrence distribution between pairs of terms, an ...
7
Monotone and fast computation of Euler’s constant
... decreasingly, respectively, to the Euler-Mascheroni constant γ at the geometric rate 1/2. Such sequences are easy to compute and satisfy complete monotonicity-type properties. As a consequence, we obtain an infinite ...
9
FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES
... An array of all pairs of geodesic distances, between nodes of a graph, is very useful for several applications such as clustering by kernel methods or graph-based segmentation or data analysis. However, computing this ...
9
Design and Implementation of Area and Power Optimized DWT Using Carry Select Adder
... In non separable method internal line buffers are use to store the boundary data among neighbour blocks such as to keep the required external frame memory bandwidth as low as the separable method. However, the external ...
7
Design an Area and Delay Optimized VLSI Architecture for DWT Using Lifting Scheme
... In non separable method internal line buffers are use to store the boundary data among neighbor blocks such as to keep the required external frame memory bandwidth as low as the separable method. However, the external ...
10
A Novel Approach for Secure Mining of Association Rules with Multi-Party Protocol
... At present, the most important association rule mining algorithm is Apriori put forward by R.Agrawal. It is an algorithm for mining the frequent itemsets. The Apriorialgorithm [1] is described as a fast algorithm ...
10
Fast and Secure Three-party Computation: The Garbled Circuit Approach
... three-party computation (3PC) where the adversary corrupts at most one party (honest majority) is an important special case that has received particular ...
18
Association Rules Mining in Vertically Distributed Databases
... on Fast Distributed Mining (FDM) algorithm and Secure Multi Party Algorithm over horizontally distributed ...over computation of arriving Association ...
8
Fast, Incremental, and Scalable All Pairs Similarity Search
... the computation is redundant across multiple invocations of AP SS, be- cause each of the AP SS instances executes independently for changing similarity threshold ...
100
A Fast Framework for the Constrained Mean Trajectory Segment Model by Avoidance of Redundant Computation on Segment
... The computation involved in density evaluation is extremely time-consuming in the case of the conventional SSM and ...our fast framework is that it changes the computation in SM from segment-based ...
14
Operation of the High Flux Reactor annual report 1982 EUR 8534 EN
... Advantages • Fusion reactor material studies: Several proven irradiation facilities under operation Advanced neutron computation and metrology • Fast breeder reactor structural materials[r] ...
36
Computation of Hilbert Transform via Discrete Cosine Transform
... the computation of the shift invari- ant wavelet transform ...the fast Fourier transform (FFT) [12], but many other meth- ods have been proposed, such as digital filtering [12,13], the parametric modelling ...
6