Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 2,975 papers for “non-recursive algorithm”
Predrag S. Stanimirovi, Predrag V. Krtolica, Rade Stanojevi · 2014
Abstract: In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated " to the arithmetic expression field enabling application of the reverse Polish notation method.
Cited by 0
Predrag S. Stanimirović, Predrag Krtolica, Rade Stanojević · Yugoslav journal of operations research · 2003
In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated" to the arithmetic expression field enabling application of the reverse Polish notation method. .
Cited by 0Open access
Thibaud Ehret, Jean‐Michel Morel, Pablo Arias · 2018
In this article we propose a new recursive video denoising method with high performance. The method is recursive and uses only the current frame and the previous denoised one. It considers the video as a set of overlapping temporal patch trajectories. Following a Bayesian approach each trajectory is modeled as linear dynamic Gaussian model and denoised by a Kalman filter. To estimate its parameters, similar patches are grouped and their trajectories are considered as sharing the same model parameters. The filtering is mainly temporal; non-local spatial similarity is only used to estimate the parameters. This temporally causal method obtains results comparable (in terms of PSNR and SSIM) to state-of-the-art methods using several frames per frame denoised, but with a higher temporal consistency.
Cited by 14
Yulai Zhang, Guiming Luo · Journal of Systems and Software · 2016
Cited by 3
Bruijn, NG de · TU/e Research Portal (Eindhoven University of Technology) · 1983
Cited by 0
Manon Costa, Sébastien Gadat · RePEc: Research Papers in Economics
In this work, we study a new recursive stochastic algorithm for the joint estimation of quantile and superquantile of an unknown distribution. The novelty of this algorithm is to use the Cesaro averaging of the quantile estimation inside the recursive approximation of the superquantile. We provide some sharp non-asymptotic bounds on the quadratic risk of the superquantile estimator for different step size sequences. We also prove new non-asymptotic Lp-controls on the Robbins Monro algorithm for quantile estimation and its averaged version. Finally, we derive a central limit theorem of our joint procedure using the diffusion approximation point of view hidden behind our stochastic algorithm.
Cited by 0
Silva, Cristiane Jahnke Fiorini da, 1986- · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2009
Submitted by Maria Aparecida (cidazen@gmail.com) on 2017-09-05T13:28:55Z No. of bitstreams: 1 Cristiane Sousa.pdf: 1146877 bytes, checksum: 1ad12b0de7d3ec703fd7018518eaf404 (MD5)
Cited by 0Open access
Gadat, Sébastien, Costa, Manon · Toulouse Capitole Publications (University Toulouse 1 Capitole) · 2021
In this work, we study a new recursive stochastic algorithm for the joint estimation of quantile and superquantile of an unknown distribution. The novelty of this algorithm is to use the Cesaro averaging of the \nquantile estimation inside the recursive approximation of the superquantile. We provide some sharp non-asymptotic bounds on the quadratic risk of the superquantile estimator for different step size sequences. We also prove new non-asymptotic Lp-controls on the Robbins Monro algorithm for quantile estimation and its averaged version. Finally, we derive a central limit theorem of our joint procedure using the diffusion approximation point of view hidden behind our stochastic algorithm.
Cited by 0
Yingtao Zhou, Yuichi Kaji · 2024
The maximum likelihood (ML) decoding is essential for error-correcting codes, but the ML decoding problem is NP-hard in general. This suggests that there is no single universal ML decoding algorithm that works efficiently for an arbitrary code. Therefore researchers developed many ML decoding algorithms with different characteristics so that they can be used complementary. This study is intended to propose an ML decoding algorithm that can be used for general non-binary linear codes. The algorithm proposed in this paper is a generalization of the adaptive and recursive ML decoding algorithm that was studied for binary codes. This paper shows that the structure and properties of linear codes that helped realizing the decoding algorithm for binary codes can be generalized to nonbinary cases, and reports the implementation results of the soft-decision ML decoding alogorithm for several non-binary linear codes.
Cited by 0
Aleksandro Costa Nogueira · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2014
Made available in DSpace on 2016-08-17T14:53:26Z (GMT). No. of bitstreams: 1 Dissertacao Aleksandro Costa.pdf: 1706153 bytes, checksum: 8d61027896dbab484303f78ed17b9b70 (MD5) Previous issue date: 2014-02-28
Cited by 0Open access
Fatima Lounoughi, Mohamed Djendi · Applied Acoustics · 2024
Cited by 1
Imam Cholissodin, Efi Riyandani · Journal of Information Technology and Computer Science · 2016
Abstract. Solving strategies in the computation the time complexity of an algorithm is very essentials. Some existing methods have inoptimal in the explanations of solutions, because it takes a long step and for the final result is not exact, or only limited utilize in solving by the approach. Actually there have been several studies that develop the final model equation Fibonacci time complexity of recursive algorithms, but the steps are still needed a complex operation. In this research has been done several major studies related to recursive algorithms Fibonacci analysis, which involves the general formula series, begin with determining the next term directly with the equation and find the sum of series also with an equation too. The method used in this study utilizing decomposition technique with backward substitution based on a single side outlining. The final results show of the single side outlining was found that this technique is able to produce exact solutions, efficient, easy to operate and more understand steps. Keywords: Time Complexity, Non-Recursive, Recursive, Fibonacci Algorithm
Cited by 4Open access
Petr Somol, Pavel Pudil, J. Grim · Lecture notes in computer science · 2001
Cited by 10
Jun Wang, Hongfa Wang, Guoying Yue et al. · 2009
A non-recursive algorithm for 4-Peg Hanoi Tower has been proposed in my previous paper without any logical and mathematical proof. So in this paper, the algorithm is verified in a rigorous and systematic way according to array theories mainly. That elements are arranged in an upper triangular array is proved to be scientific, iteration path based on the cross correlation is proved to be a shortcut to solve the problem, and the minimum iteration is proved to be on more than R(n) for a 4-peg problem with n disks. Therefore, the non-recursive algorithm has been proved to be more superior to traditional recursive algorithm theoretically.
Cited by 1
Zhengkang Zuo, Yue Fang, Qing Huang et al. · 2021
The development of loop invariants for recursive problems of nonlinear data structures are always difficult problems in formal development. The paper studies the derivation and formal proof of binary tree non-recursive algorithm. The non-recursive Apla algorithm of binary tree depth and its exact and simple loop invariant are derived. Then, Dijkstra-Gries’ standard proving technique is used to prove the correctness of the algorithm. In the end, Apla to C++ program automatic generation system automatically generates C++ code, which realizes the complete refinement process from abstract specification to concrete executable program. The experimental results of the example simplify the derivation and proof of the algorithm program and point out the direction for the exploration of loop invariant of non-recursive algorithm for recursive problems. It has guiding significance for the formal proof of algorithm program for nonlinear data structure.
Cited by 0
Jinkun Jiang, Qi Zhang, Xiangjun Xin et al. · 2023
A non-recursive energy-free bounded-energy trellis calculation algorithm is proposed in this paper. Based on the derivation of the recursive relationship of the trellis nodes, a non-recursive calculation method is applied, and energy-related calculations are removed, thereby reducing the computational complexity. The results of complexity analysis and numerical simulation show that under different block lengths, maximum energy, and amplitude alphabet size, lower complexity always be achieved by the proposed algorithm.
Cited by 0
Ikram Kaoula, Guessoum Abderrezak, Boualem Kazed · International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering · 2023
Non-invasive maternal electrocardiogram recording is the least unpleasant method to record a weak fetal electrocardiogram signal. The importance of this recording lies in the fact that it reveals crucial information about the fetal health state, especially during the last four weeks of pregnancy. This paper will be concerned with a new adaptive algorithm, namely the generalized recursive algorithm, to isolate and get the fetal electrocardiogram from the abdominal maternal electrocardiogram. This is achieved using a non-invasive method for bi-channel maternal electrocardiogram recordings i.e., with the thoracic maternal electrocardiogram as a reference signal, and the abdominal maternal electrocardiogram as a primary signal. Prior to this procedure, the discrete wavelet transform (DWT) method is applied to the abdominal electrocardiogram signal to clean it from any additive noise and the baseline wandering that is generally present on the raw recordings. The proposed new adaptive filter is shown to deliver improved characteristics through simulations. These simulations were performed on both synthetic and actual signals. This work was compared with the normalized least mean square algorithm.
Cited by 0Open access
E G Birgin, R D Lobato, R Morabito · RePEc: Research Papers in Economics
In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method.
Cited by 0
Sheng Chen, S.A. Billings, P.M. Grant · International Journal of Control · 1992
Recursive identification of non-linear systems is investigated using radial basis function networks. A novel approach is adopted which employs a hybrid clustering and least squares algorithm. The recursive clustering algorithm adjusts the centres of the radial basis function network while the recursive least squares algorithm estimates the connection weights of the network. Because these two recursive learning rules are both linear, rapid convergence is guaranteed and this hybrid algorithm significantly enhances the real-time or adaptive capability of radial basis function models. The application to simulated real data are included to demonstrate the effectiveness of this hybrid approach.
Cited by 342
В. Н. Карнаухов, M. G. Mozerov · Journal of Communications Technology and Electronics · 2018
Abstract—A theoretically derived technique for acceleration of the original non-local means image denoising algorithm based on calculation of recursive patch similarity weights is proposed. A significant amount of computation in the non-local means scheme is dedicated to estimation of the patch similarity between pixel neighborhoods. The proposed recursive weights calculation scheme adopts the classic recursive mean calculation scheme for a multidimensional shift-vector in order to lower the computational complexity of the original non-local means method, thus speeding up this algorithm more than tenfold. Note that the output of the proposed algorithm is exactly the same as that of the original non-local means method. Hence this algorithm belongs to the class of true fast algorithms, unlike methods approaching to a certain degree the resul of the original algorithm.
Cited by 9