become computationally expensive and inefficient as the dimensionality increases. This article presents a novel fast algorithm for computing high-dimensional Gauss quadrature rules, significantly reducing computational…
most datasets (or) subsets which are relevant to the users search. By using FAST algorithm we can retrieve the data’s without the irrelevant features. Here the irrelevant features ... time taken for retrieve the…
most promising solutions for 3D video broadcasting. In this paper, a fast algorithm exploiting the content similarity is proposed to reduce the computational complexity for coding FCF. A low complexity ... inter leaved…
parallel algorithms are also introduced performance metrics. Finally, a practical application, reflects the fast Fourier transform algorithm used in parallel, through the main parallel FFT algorithm is studied, expect…
subset of features. Based on these criteria, a Fast clustering-based feature Selection algorithm (FAST) is proposed and experimentally evaluated. The FAST algorithm works in two steps. In the first ... tree at a time…
which can be explicitly solved in an iterative way. A fast clusteringbased feature selection algorithm (FAST) works in two steps. In the first step, graph-theoretic clustering methods are used ... cluster are…
problem because it determines the compression efficiency and complexity of a video encoder. Many fast algorithms for block matching have been proposed in the past. This paper present a parallel ... architecture for a…
method: the particle swarm optimization (PSO), the hybrid cooperative-comprehensive learning based PSO algorithm (HCOCLPSO), the Fast Otsu’s method and the honey bee mating optimization (HBMO). The experimental results
Fast Fourier Transforms (FFT), Discrete Cosine Transforms (DCT) are major blocks in communication systems.FFT is used to compute DFT with reduced number of arithmetic units. The major applications ... reports the…
relations to real-world impedance measurements. In this study a computational algorithm, based on the Fast Fourier Transform (FFT) theory, the Hilbert transformation of impedance data, and a validated impedance…
data set. Rotation Forest and Extended Space Forest algorithms are used to calculate the accuracy. A novel approach Fast Rotation Forest is introduced to enrich the accuracy rate. The idea
ring algorithms LMS algorithm is very common, in our work also we use LMS algorithm. LMS-ALE filters removes the sinusoidal noise signals present in the channel by calculating ... iteration. LMSALE filter has large…
ring algorithms LMS algorithm is very common, in our work also we use LMS algorithm. LMS-ALE filters removes the sinusoidal noise signals present in the channel by calculating ... filter has large number of multiplier…
dimensional data clustering and feature selection process is carried out using the Fast clustering algorithm. FAST algorithm is divided into two steps. In the first step, features are divided into ... Spanning Tree…
been considered. An appropriate comparison has been drawn among proposed technique i.e. fast approximation algorithm and previous well known techniques. The objective is to effectively optimize energies so that…
rules in vertically distributed databases. The protocol [1] was experimented based on Fast Distributed Mining (FDM) algorithm and Secure Multi Party Algorithm over horizontally distributed databases. Our protocol is…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.