Suggested Topics within your search.
Suggested Topics within your search.
-
241
The Fast Blind Equalization Algorithm with Global Convergence
Published 1997-01-01Get full text
Article -
242
Probabilistic decoding algorithm for quantum stabilizer codes
Published 2011-01-01“…To improve the performance of quantum decoding algorithm,a quantum probabilistic decoding algorithm(QPDA) based on the check matrix for quantum stabilizer codes was proposed.To achieve low error rates the error op-erator with the minimum quantum weight was chosen and to shorten the time of decoding a quantum standard array(QSA) was constructed before decoding.Comparing with the quantum maximum likelihood decoding algorithm,the QPAD improves the reliability of degenerate decoding due to uniform decoding methods for degenerate and non-degenerate codes,furthermore,has less complexity due to does not require pre-search the bases of vector space cor-responding to the error operator.…”
Get full text
Article -
243
Shape detection algorithm applicable to solar estimation
Published 2021-07-01“…This paper presents a bio-inspired hybrid algorithm for shape detection applicable to solar estimation in solar power plants. …”
Get full text
Article -
244
-
245
Review on algorithms of dealing with depressions in grid DEM
Published 2019-04-01“…Existing ways of improving the computation efficiency of depression-processing algorithms are also presented, i.e. serial algorithm optimization and parallel algorithms. …”
Get full text
Article -
246
An Evolved Wavelet Library Based on Genetic Algorithm
Published 2014-01-01“…As the size of the images being captured increases, there is a need for a robust algorithm for image compression which satiates the bandwidth limitation of the transmitted channels and preserves the image resolution without considerable loss in the image quality. …”
Get full text
Article -
247
Novel and Efficient Randomized Algorithms for Feature Selection
Published 2020-09-01Subjects: Get full text
Article -
248
An overview on algorithms and applications of deep reinforcement learning
Published 2020-12-01“…Deep reinforcement learning (DRL) is mainly applied to solve the perception-decision problem, and has become an important research branch in the field of artificial intelligence.Two kinds of DRL algorithms based on value function and policy gradient were summarized, including deep Q network, policy gradient as well as related developed algorithms.In addition, the applications of DRL in video games, navigation, multi-agent cooperation and recommendation field were intensively reviewed.Finally, a prospect for the future research of DRL was made, and some research suggestions were given.…”
Get full text
Article -
249
-
250
Optimization of the learning rate in the algorithm for data visualization
Published 2005-12-01“…The paper describes an unsupervised backpropagation algorithm to train a multilayer feed-forward neural network (SAMANN) to perform the Sammon‘s nonlinear projection. …”
Get full text
Article -
251
Performance Evaluation of LMS and CM Algorithms for Beamforming
Published 2022-01-01“…In this paper, we compare the performances of the least mean square (LMS) and constant modulus (CM) algorithms for beamforming. Our interest in these algorithms finds its origins in their reliability as a source-receiver pair. …”
Get full text
Article -
252
Inverse scattering transform algorithm for the Manakov system
Published 2023-12-01Subjects: Get full text
Article -
253
-
254
Intelligent Load Balancing Algorithm of Mega Constellation
Published 2023-12-01Subjects: Get full text
Article -
255
Trajectory clustering algorithm based on structural similarity
Published 2011-01-01“…For current trajectory clustering algorithms,most of them group full trajectories as basic units,and lead the low efficient results.Aiming at this problem,a trajectory clustering algorithm based on structural similarity was proposed.By introducing a new concept of trajectory structure and presenting structural similarity function,the internal and external features of trajectories were analyzed.The algorithm first partitioned trajectories into trajectory segments according to corner;then computed the matching degree between every trajectory segment pairs by comparing their structure features;finally grouped trajectories into clusters.Experiment results on real data set demonstrate not only the efficiency and effectiveness of the algorithm,but also the flexibility that feature sensitivity can be adjusted by different parameters.…”
Get full text
Article -
256
-
257
An overview of ultra-wideband indoor positioning algorithms
Published 2018-09-01Subjects: Get full text
Article -
258
-
259
An Augmented Lagrangian Algorithm for Solving Semiinfinite Programming
Published 2012-01-01“…We present a smooth augmented Lagrangian algorithm for semiinfinite programming (SIP). For this algorithm, we establish a perturbation theorem under mild conditions. …”
Get full text
Article -
260
Parallelization of the Bison Algorithm Applied to Data Classification
Published 2024-11-01“…Algorithms…”
Get full text
Article