Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

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 “Efficient algorithm”

An Efficient Algorithm

For Identifying Objects, Kelly A. Lyons · 1994

this paper, we show that if the objects have a fixed orientation and position, m- 1 probes are necessary and sufficient to identify an object. Natarajan solves a slightly different problem[Nata87]. Given one n-sided object with n possible orientations, Natarajan shows that n 2 probes are necessary and n are sufficient to determine the orientation of the object. This result is similar to ours with m=n and each object identical but oriented differently (we allow m different objects)

Cited by 0

An Efficient Parallel Algorithm

Kevin B. Theobald, Guang R. Gao · 1991

This paper presents a parallel algorithm for the All Pairs Examination problem, which appears in many applications. This algoriihm examines all pairs in a set of n2 elements on n processors in n+ 1 computation steps. Each element resides in only one processor during each step. This method uses processor time optimally and requires fewer communication steps than previous algorithms, with minimal network trafic and low run-time overhead. The most challenging aspect is finding a mapping of elements to processors for each of the n+ 1 steps which enables all pairs to be examined. It is proven herein that the task of finding such a mapping can be reduced to a simpler problem involving automorphic transformations on permutation groups. If n is a power of a prime, then a solution to this simpler problem exists, based on manipulation of the permutation group using linear feedback shift registers, and it can always be found in 0(112] time.

Cited by 0

Efficient algorithm for MAX2SAT

Dumitrescu, Cristian · Figshare · 2017

My work is related to randomized, efficient algorithms for NP-complete problems.

Cited by 0Open access

Efficient algorithm for MAX2SAT

Dumitrescu Cristian · Figshare · 2017

My work is related to randomized, efficient algorithms for NP-complete problems.

Cited by 0Open access

Efficient Superimposition Recovering Algorithm

Han Li, Kun Gai, Pinghua Gong et al. · arXiv (Cornell University) · 2012

In this article, we address the issue of recovering latent transparent layers from superimposition images. Here, we assume we have the estimated transformations and extracted gradients of latent layers. To rapidly recover high-quality image layers, we propose an Efficient Superimposition Recovering Algorithm (ESRA) by extending the framework of accelerated gradient method. In addition, a key building block (in each iteration) in our proposed method is the proximal operator calculating. Here we propose to employ a dual approach and present our Parallel Algorithm with Constrained Total Variation (PACTV) method. Our recovering method not only reconstructs high-quality layers without color-bias problem, but also theoretically guarantees good convergence performance.

Cited by 0Open access

Enhanced DES Algorithm Using Efficient Classical Algorithm

Inas Ali Abdulmunem, Mays M. Hoobi · Iraqi Journal of Science · 2024

The privacy, confidentiality, and integrity of user information are very important concerns; therefore, cryptography is the solution to keep and satisfy these objectives. Encryption is the most important policy that is used to make transmitted messages have a high level of security and be so difficult to crack by attackers. The main aim of this research is divided into two parts: The aim of Part 1 is to obtain the highest level of complexity against the attacker by applying six classical cryptography algorithms to the same plain-text message. These six algorithms are Vigenère, Porta, Autokey, Beaufort, Trithemuis, and Gronsfeld. Also, in this part, several analysis tools are used to evaluate the performance of the six algorithms: entropy, histogram, and autocorrelation. Part 2 of this research aims to apply the results of Part 1 by using the best algorithm among these six algorithms (Vigenère) to improve the security level of the Data Encryption Standard (DES) algorithm by applying two experiments for two hybrid ciphering models. Each experiment has three cases. The first experiment included three cases: the first case included ciphering plain text by using only the Vigenère algorithm, the second case included ciphering plain text by using only the ECB DES algorithm, and the third case included multilevel ciphering plain text by using Vigenère and then ECB DES algorithms, while the second experiment for the second hybrid ciphering model included the same cases as the first experiment but applied CBC DES, another type of DES algorithm. The results of this research indicated different efficiency levels of six classical algorithms, and the Vigenère algorithm is the best and offers the highest level of complexity among the used algorithms. In addition, the Vigenère algorithm can be used to enhance the security level of cryptography algorithms and increase the complexity of cracking ciphertext when combined with another algorithm like the DES algorithm.

Cited by 0Open access

An Efficient Algorithm for Face Localization An Efficient Algorithm for Face Localization

Shahpour Alirezaee, Hassan Aghaeinia, Karim Faez et al. · 2008

Detecting and localizing a face in a single image is the most important part of almost all face recognition systems. Face localization aims to determine the image position of a face for verification purpose of documents such as passport, driving license, ID cards, etc. In this paper an entropy-based method is proposed for detecting the high information region of the image which may include eyes, mouth, nose, etc. The derived regions in this stage of recognition are sent to feature extraction and classification phase. The method has been tested on the ORL database. The results show the effectiveness and robustness of the proposed method for face detection and localization in presence of white additive Gaussian noise up to 25 dbw. We have achieved localization rate 99.75 % for detection of faces in the ORL data set that we had which means 1 miss over 400 ORL faces.

Cited by 0

Algorithm Control: Efficient Learning to Control Algorithm Parameters

Marius Lindauer · TIB Repositorium · 2024

Es ist weithin bekannt, dass die Performanz von vielen Algorithmen von ihren Parametern abhängt. Um mühsames und fehleranfälliges Parameteroptimieren zu vermeiden, wurden automatisierte Ansätze entwickelt, um effizient Spitzenleistungen von Algorithmen zu erreichen. Allerdings haben diese Ansätze den Nachteil, dass die Parametereinstellungen nur einmalig festgelegt werden, obwohl viele hand-designte, interne Heuristiken von KI-Algorithmen meist reaktiver Natur sind und Parameter dynamisch während der Laufzeit anpassen. In diesem Projekt haben wir Ansätze entwickelt, um solche reaktiven, dynamischen Heuristiken zur Steuerung von Parametern aus Daten automatisch zu lernen gelernt und damit die Effizienz der Algorithmen noch weiter zu steigern. Dazu setzten wir auf neuste Erkenntnisse aus dem Bereich des Bestärkenden Lernens, in dem wir die Aufgabe der Algorithmenkontrolle als kontextuelles MDP formulieren. So konnten wir Algorithmen aus mehreren Bereichen deutlich effizienter gestalten, etwa im Automatischen Planen, in Evolutionären Algorithmen oder im Deep Learning. Damit die Community weiterhin dynamisch in diesen Domänen arbeiten kann, haben wir außerdem eine frei verfügbare Benchmark-Library erstellt. Um das Bestärkende Lernen für Algorithmenkontrolle anzupassen haben wir desweiteren Ansätze entwickelt, um die zeitliche Komponente sowie den Instanzkontext explizit zu modellieren. Dieses Projekt lieferte also die theoretischen, praktischen und empirischen Grundlagen und die erste Benchmark-Library zur Algorithmenkontrolle. Des Weiteren zeigten wir erstmals das Potenzial des Bestärkenden Lernens für diese Aufgabe, erweiterte das Bestärkende Lernen anhand von Algorithmenkontrolle und konnte so Algorithmen verschiedener Domänen deutlich verbessern. Datei-Upload durch TIB

Cited by 0Open access

Efficient Algorithm Design and Application in Algorithm Application

Telaga Kmalla, Grega, Kolosov et al. · Journal of Research in Science and Engineering · 2022

Multiplier plays key role in Digital Signal Processing and FPGA based applications, as it consumes more power and area compared other devices. In DSP and FPGA based applications power, speed and area all are important parameters and all depend on multiplier which in turn depends on adders. So, by implementing adders we can reduce the delay. Pyramidal adders are used which uses half-adder and full-adder to increase the speed and to reduce the number of gates used in the multiplier, but delay is not decreased significantly.

Cited by 0Open access

Algorithm for Efficient Entropy Estimation

E. A. Timofeev · SHILAP Revista de lepidopterología · 2013

We consider the problem of the nonparametric entropy estimation of a stationary ergodic process. Our approach is based on the nearest-neighbor distances. We propose a broad class of metrics on the space Ω = A<sup>N</sup> of right-sided infinite sequences drawn from a finite alphabet A. The new metric has a parameter which is a non-increasing function. We apply this metrics to nearest-neighbor entropy estimators. We prove that, under certain conditions, the estimators has a small variance. We show that a special selection of the metric parameters reduction of the estimator’s bias. The article is published in the author’s wording.

Cited by 0Open access

Efficient Weighted Average Calculation Algorithm

Matthew Tambiah · HAL (Le Centre pour la Communication Scientifique Directe) · 2021

This paper presents an efficient algorithm (method) for calculating Weighted Averages called the "Fast Weighted Average calculation method. In general, the algorithm presented in textbooks for calculating a Weighted Average of n elements (each with a Values and a Weight) will require n multiplication operations. This paper presents a calculation algorithm for calculating the Weighted Average of elements using at most (n − 1) multiplication operations when using Normalized Weights.

Cited by 0Open access

An Efficient Hybridized Genetic Algorithm

Kun Li, Liwei Jia, Xiaoming Shi · 2018 IEEE International Conference of Safety Produce Informatization (IICSPI) · 2018

Aiming at deficient hencies in global search and convergence speed of traditional basic genetic algorithm, a novel hybrid genetic algorithm based on simulated annealing is proposed. The proposed algorithm not only has all the features of traditional genetic algorithm, but also further improves the global searching ability, prevents it from premature convergence, obtains fast convergence and high computational precision. The numerical experiments show that this algorithm has great advantage of con-vengeance property, on-line and off-line programming over the original genetic algorithm.

Cited by 9

Efficient Algorithm for Distribution Networks

Pierre F. Lemieux · Journal of the Hydraulics Division · 1972

Because of the characteristics of the Jacobian matrix, modifications to the Newton’s approach of solving pipe networks can be done in such a way that convergence toward the solution is ensured, computer time and memory storage are saved. The modified Newton’s algorithm not only ensures convergence, but also reduces the number of iterations when compared with the classical Newton’s algorithm.

Cited by 33