Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Deterministic algorithm”
Josh Conway, George A. Sefler, George C. Valley et al. · 2008
Phase ripple arising from imperfections in novel dispersive devices can severely distort broadband optical signals. We experimentally and theoretically demonstrate an algorithm that corrects for these distortions while simultaneously reducing the effects of additive noise.
Cited by 0
Sin-Chun Ng, S.H. Leung, A. Luk · 2000
Introduces a learning algorithm for multi-layered feedforward network-weight evolution algorithm with deterministic perturbation. During the learning phase of the gradient algorithm (such as backpropagation), the network weights are adjusted intentionally in order to have an improvement in system performance. The intention is to reduce the overall system error after every weight update. By looking at the error component, it is possible to adjust some of the network weights dramatically so as to have an overall reduction in system error. Using the deterministic perturbation, it is found that the weight evolution between the hidden and output layer can accelerate the convergence speed, whereas the weight evolution between the input layer and the hidden layer can assist in solving the local minima problem.
Cited by 1
Gerace I., Martinelli F., Pucci P. · ISTI Open Portal · 2011
In this paper we propose a new deterministic algorithm for determining optical flow through regularization techniques so that the solution of the problem is defined as the minimum of an appropriate energy function. We also assume that the displacements are piecewise continuous and that the discontinuities are variable to be estimated. More precisely, we introduce a hierarchical three-step optimization strategy to minimize the constructed energy function, which is not convex. In the first step we find a suitable initial guess of the displacements field by a gradient-based GNC algorithm. In the second step we define the local energy of a displacement field as the energy function obtained by fixing all the field with the exception of a row or of a column. Then, through an application of the shortest path technique we minimize iteratively each local energy function restricted to a row or to a column until we arrive at a fixed point. In the last step we use again a GNC algorithm to recover a sub-pixel accuracy. The experimental results confirm the goodness of this technique.
Cited by 0
Beals, Alan James. · The Journal of the Abraham Lincoln Association
"Supported in part by the Advanced Research Projects Agency ... under Contract no. US AF 30(602) 4144."
Cited by 0Open access
A. Chetna Dabas, B. Mamta Balhara, C. J. P. Gupta · 2009
Abstract—Radio Frequency Identification (RFID) systems have emerged as popular and affordable solution for object identification in the recent years. One of the significant performance issues in these systems is to resolve the RFID Tag collision.Tag Collision happens when more than one tag reflect back a signal at the same time confusing the RFID reader. This collision disturbs the reader’s identification process. This paper presents a novel anticollision deterministic algorithm with a unique CDMA based data coding encryption scheme to resolve the anticollision problem for passive RFID Tags. I.
Cited by 0
Olof Barr · SHILAP Revista de lepidopterología · 2005
We construct a modified perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3lognlog(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct a non-deterministic modified perceptron algorithm running in timeO(mn2lognlog(1/ρ)).
Cited by 0Open access
Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2006
Bandwidth extension algorithm for multiple deterministic systems by Xu Didi thesis 2006 xii, 96 leaves : ill. ; 30 cm Bandwidth extension (BWE) is a field that has attracted increasing attention in recent years because bandwidth reduction can happen, for…Read more ›
Cited by 0
Sonam Jain, Bhopal India, Vivek Kumar · 2016
Abstract-Bit parallel string matching algorithms are the latest and the efficient class of algorithm for string matching. It uses the intrinsic parallelism inside a computer word is known as bit parallelism. BNDM is the most popular bit parallel string matching algorithm. This algorithm can directly use for various real world problem like as Detection of Intrusion in the network, Data extraction and mine, avoiding Plagiarism, use of Bioinformatics in various medical field. BNDM algorithm having their standard implementation where lots of bit wise operations are checking as not in bit parallel mode like as MSB of bit vector is one or not or the value of the bit vector is zero or non-zero. All these operations are the comparison based operation which are quite time consuming. If these operations are optimized or simplified in bit parallelism based operations than they have their best bit parallelism based implementation. In this paper we are found out such operations and simplified in pure bit parallel based implementation. Here we simplified the popular algorithm BNDM and named as Efficient Backward Non Deterministic Matching (EBNDM) Algorithm. The working of Efficient Backward Non Deterministic Matching (EBNDM) Algorithm is same as classical one but due to use of bit wise operation in place of comparison operator our algorithm gives better result. Experimental results show that our EBNDM algorithm is better than the standard implementation.
Cited by 0
Chaomurilige Chaomurilige, Jian Yu, Miin‐Shen Yang · Information Sciences · 2017
Cited by 35
Fouad Sahib Muhamed Alkhazraji · Zenodo (CERN European Organization for Nuclear Research) · 2026
"URGENT CORRECTION NOTICE (January 2, 2026): Please be advised that the 2048-bit RSA Key (617 Digits) currently provided in the uploaded file/description contains a typographical error. This specific numerical value is being verified and will be updated to the correct version within the next few hours. Consequently, the calculated search range (Start/End Bounds) based on this specific key should be reconsidered until the corrected value is published. We apologize for this oversight."
Cited by 0Open access
Didi Xu · 2006
Cited by 0
Mia Hubert, Peter J. Rousseeuw, Tim Verdonck · 2009
Cited by 1
Dennis Giffhorn, Gregor Snelting · International Journal of Information Security · 2014
Cited by 28
Zenon Sadowski · Lecture notes in computer science · 1999
Cited by 13
Kurt Mehlhorn, Michael Sagraloff · 2008
We describe a Descartes algorithm for root\nisolation of polynomials with real coefficients. It is assumed that\nthe coefficients of the polynomial can be approximated with arbitrary \nprecision; exact\ncomputation in the field of coefficients is not required. We refer to such\ncoefficients as bitstream coefficients. The algorithm is\ndeterministic and has almost the same asymptotic complexity as the \nrandomized bitstream-Descartes algorithm of~\\citet{BitstreamDescartes}. Besides\nbeing deterministic, the algorithm is also somewhat simpler\nto analyze.
Cited by 4
Kyoichi Okamoto, Osamu Watanabe · Lecture notes in computer science · 2001
Cited by 1
Tim Verdonck, Mia Hubert, Peter J. Rousseeuw · 2009
Cited by 0
Fouad Sahib Muhamed Alkhazraji · Zenodo (CERN European Organization for Nuclear Research) · 2026
"URGENT CORRECTION NOTICE (January 2, 2026): Please be advised that the 2048-bit RSA Key (617 Digits) currently provided in the uploaded file/description contains a typographical error. This specific numerical value is being verified and will be updated to the correct version within the next few hours. Consequently, the calculated search range (Start/End Bounds) based on this specific key should be reconsidered until the corrected value is published. We apologize for this oversight."
Cited by 0Open access
Tam, CK, Bucknall, RWG · UCL Discovery (University College London)
Cited by 0
Issei Sato, Kenichi Kurihara · 2010
We develop a deterministic single-pass algorithm for latent Dirichlet allocation (LDA) in order to process received documents one at a time and then discard them in an excess text stream. Our algorithm does not need to store old statistics for all data. The proposed algorithm is much faster than a batch algorithm and is comparable to the batch algorithm in terms of perplexity in experiments. 1
Cited by 0