fast algorithm
Fast Algorithm for Morphological Filters
... A fast algorithm is proposed based on the alpha ...The algorithm depends on Delaunay triangulation with time complexity ...proposed algorithm works well both for morphological profile and area ...
6
A Fast Algorithm for Reconstructing and Flattening Digitised Surfaces
... surface-flattening algorithm is needed. In this article a new fast algorithm for surface reconstruction and surface flattening, based on a divide-and-conquer strategy, is ...
12
Data Cluster Formation Using FAST Algorithm
... selection algorithm is accuracy is not guaranteed, computational complexity is large, ineffective at removing redundant ...problems Fast Clustering based feature selection algorithm (FAST) is ...
6
A Fast Algorithm for the Generation of Referring Expressions
... A Fast Algorithm for the Generation of Referring Expressions A Fast A l g o r i t h m for t h e G e n e r a t i o n of Referring Expressions A b s t r a c t We simplify previous work in t h e developm[.] ...
7
The Properties and Fast Algorithm of Quaternion Linear Canonical Transform
... In the rest of this paper, we will introduce the definition of QLCT in Section II. We will show the properties in Section III. In Section IV, FRQCV and FRQCR will be addressed. Section V is the fast ...
15
Fast algorithm for the 3-D DCT-II
... our algorithm. The main consideration in choosing a fast algorithm is computational and structural ...very fast, and regular com- putational structure becomes the most important factor ...
11
A Fast Algorithm for Automated Quality Control in Surface Engineering
... and fast solution to this ...proposed algorithm is ca- pable of recognizing the quality of an optimal surface (image) in comparison to unfinished versions of ...
7
Fast Algorithm in ECC for Wireless Sensor Network
... Of multiplying point P on an elliptic curve E defined over a field GF(p) with positive integer k which involves point addition and point doubling. Operational efficiency of kP is affected by the type of coordinate system ...
5
A Fast Algorithm for Functional Mapping of Complex Traits
... simplex algorithm as an alternative to solve the mixture-based likelihood for functional mapping of complex ...simplex algorithm are consistent with those from the traditional EM algorithm, but the ...
6
A fast algorithm for determining optimal feedback gain
... This storage problem is resolved by the redued order approah in Setion. 5 and by the inverse Hamiltonian based redued order method in Setion 6..[r] ...
19
A fast algorithm for finding correlation clusters in noise data
... Instead of agglomerating randomly generated micro clusters into final clusters, we partition a data set into clusters in a top-down manner. The key idea for such a divi- sive method is to find a suitable criterion for ...
8
A fast algorithm for finding correlation clusters in noise data
... A key question is how to partition the data. Given a dataset, the projected cluster problem can be regarded as the one of partition of the dataset into k clusters such that the sum of the projected distance of each data ...
9
A fast algorithm for matrix balancing
... Sinkhorn-Knopp algorithm offers a simple and reliable approach to balancing; but its limitations become clear when the matrices involved exhibit a degree of sparsity (in particular, the a priori measure of ...
18
In Close, a fast algorithm for computing formal concepts
... In-Close significantly outperformed the serial version Krajca in all experi- ments. Published results [12], comparing the serial version of Krajca with sev- eral well known algorithms, showed Krajca to be the fastest, by ...
15
A fast no-rejection algorithm for the Category Game
... the fast algorithm is the computation of the probability that at each time step a game between a randomly chosen pair of players together with a randomly selected topic in the interval [0, 1) would produce ...
18
Enhanced Feature Selection Algorithm (FAST) for Large Data
... improvised algorithm that weights each property based on the ability to select samples for different purposes based on the distance threshold ...analysis. FAST Algorithm [19] Using Methods Grouped ...
10
A Fast Convex Hull Algorithm for Binary Image
... a fast algorithm based on these new properties to extract convex hull of the object in binary ...proposed algorithm has low complexities of time and ...
8
Improving the Efficiency of Fast Using Semantic Similarity Algorithm
... II. BACKGROUND AND RELATED WORK Feature subset selection is a process of discovering and eliminating as many irrelevant and redundant features as much as possible. Reason for this is 1) irrelevant features do not ...
5
Quantization Effects and Stabilization of the Fast Kalman Algorithm
... the fast-Kalman scheme [4] is examined on the basis of a set of newly introduced principles and by means of an entirely new methodology and philoso- phy, which are drastically different from the ones under- taken ...
12
A Fast Recognition Algorithm for Photoelectric Peeping Equipment
... With the popularization of photoelectric device such as burglary pinhole cameras and miniature cameras, indoor activities are facing an increasingly serious threat of information disclosure. Examples include political ...
8