Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri
Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri
International Journal of Business and Technology
In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-level of computing. The algorithm is O(n2) and running sequentially achieves at least ~1/5 n2 number of basic necessary accesses of data structures. In this paper is also presented a comparison of running performances in practice between the new algorithm and the current most famous algorithm for 3SUM which is in-place and also based on sorting.
The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica
The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica
UBT International Conference
Digital image processing is an area that finds many applications in three-dimensional graphics. One of the subjects considered in image processing is detection of moving objects. In this paper, we have analyzed the performance of an algorithm that detects a moving object. The performance relates to the speed of moving object during a pre-determined time interval. The methodology supports Matlab integrated with built-in functions. Specifically, as input of the simulation model is a video material containing moving objects. The model reads a video file presenting moving objects; after the model is executed in Matlab, the output emits moving objects associated …
Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini
Efficiency Of Calculating Gcd Through Computer With Help Of Modified Euclidean Algorithm, Emin Emini, Azir Jusufi, Ruhada Emini
UBT International Conference
Euclid’s algorithm remains to be the most efficient method for finding greatest common divisor of two full numbers. By using the meaning of congruences this research paper will make a modification in the note of the Euclid’s algorithm. Here are discussed both classic and modified methods, by putting appropriate codes and observe the duration of the calculation through the computer.