Advanced Search
Cancel
Found: 3 Piece 0.002 sn
- You can use the 'AND' / 'OR' / 'NOT' option for the things you want to add or remove.
- You can return to normal search by pressing the Cancel button.
Filters
Filters
Found: 3 Piece 0.002 sn
Researcher : Rita İSMAİLOVA ✕Researcher : Rayımbek SULTANOV ✕
Collection [1]
Researcher [3]
UN Sustainable Development [1]
Faculty / Institute [1]
Publication type [1]
Publication year [3]
Language [2]
Source [2]
Databases [5]
Index Type [4]
Publisher [2]
Department [1]
National/International [2]
Subject Headings [16]
Doç. Dr. Rita İSMAİLOVAMühendislik Fakültesi
Doç. Dr. Rayımbek SULTANOVMühendislik Fakültesi
Access to Files

Факторизациялоо алгоритмдердин салыштырмалуу анализи = Comparative analysis of integer factorization algorithms

Gulida KIMSANOVA | Rita İSMAİLOVA | Rayımbek SULTANOV

Көптөгөн ачык ачкычтуу криптосистемалардын негизи катары колдонулган натуралдык санды факторизациялоо проблемасы заманбап компьютерлер үчүн да оор маселе болуп саналат. Биз бул иште С программалоо тилинде GMP китепканасын колдонуп, 4 алгоритмди иштеп чыктык жана бул алгоритмдердин иштөө убакыттарын салыштырдык. Алгоритмдер ар кандай өлчөмдөгү сандарды, ошондой эле факторлорунун ортосунда ар кандай аралык болгон сандарды факторизациялоо үчүн колдонулду.Биздин жыйынтыктар 296 биттик санды факторлорго ажыратууда Поллард rho алгоритминин эң бат иштешин, ошол эле учурда, факторлордун ортосундагы ар ...More

Article 2015 Mühendislik Fakültesi MANAS Journal of Engineering (MJEN)3 ( 2 ) 126 Views
Access to Files

An algorithm for line matching in an image by mapping into an n-dimensional vector space

Rayımbek SULTANOV | Rita İSMAİLOVA

This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplification, there were 5-6 iterations for n = 13. To check how close the curve approximation ...More

Article 2019 Mühendislik Fakültesi Turkish Journal of Electrical Engineering and Computer Sciences27 ( 5 ) 56 Views
Access to Files

Comparative Analysis Of Integer Factorization Algorithms Using Cpu And Gpu = Сравнительный анализ алгоритмов целочисленной факторизации при работе на Центральном ЦПУ и ГПУ

Gulida KIMSANOVA | Rita İSMAİLOVA | Rayımbek SULTANOV

In this work we have evaluated the running time of four integer factorization algorithms, namely, trial division algorithm, Fermat algorithm, Pollard rho and Brent algorithms. Implementation of these algorithms was performed in three ways on c programming language, on c programming language, using GMP 6.0.0 library and on CUDA architecture to run on GPU. Results showed that Fermat algorithm and trivial division algorithm had the fastest running time in parallel implementation on CUDA architecture. The difference of running times between CUDA implementation and GMP implementation was up to 10 t ...More

Article 2017 Mühendislik Fakültesi MANAS Journal of Engineering (MJEN)5 ( 1 ) 97 Views
Our obligations and policy regarding cookies are subject to the TR Law on the Protection of Personal Data No. 6698.
OK
creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms