Academic literature on the topic 'Shorův algoritmus'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Shorův algoritmus.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Shorův algoritmus"

1

Litinskaia, Evgeniia L., Pavel A. Rudenko, Kirill V. Pozhar, and Nikolai A. Bazaev. "Validation of Short-Term Blood Glucose Prediction Algorithms." International Journal of Pharma Medicine and Biological Sciences 8, no. 2 (2019): 34–39. http://dx.doi.org/10.18178/ijpmbs.8.2.34-39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cherckesova, Larissa, Olga Safaryan, Pavel Razumov, Irina Pilipenko, Yuriy Ivanov, and Ivan Smirnov. "Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part." E3S Web of Conferences 224 (2020): 01016. http://dx.doi.org/10.1051/e3sconf/202022401016.

Full text
Abstract:
This report discusses Shor’s quantum factorization algorithm and ρ–Pollard’s factorization algorithm. Shor’s quantum factorization algorithm consists of classical and quantum parts. In the classical part, it is proposed to use Euclidean algorithm, to find the greatest common divisor (GCD), but now exist large number of modern algorithms for finding GCD. Results of calculations of 8 algorithms were considered, among which algorithm with lowest execution rate of task was identified, which allowed the quantum algorithm as whole to work faster, which in turn provides greater potential for practica
APA, Harvard, Vancouver, ISO, and other styles
3

Ekerå, Martin. "Quantum algorithms for computing general discrete logarithms and orders with tradeoffs." Journal of Mathematical Cryptology 15, no. 1 (2021): 359–407. http://dx.doi.org/10.1515/jmc-2020-0006.

Full text
Abstract:
Abstract We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms. In particular, we enable tradeoffs when computing general discrete logarithms. Compared to Shor's algorithm, this yields a reduction by up to a factor of two in the number of group operations evaluated quantumly in each run, at the expense of having to perform multiple runs. Unlike Shor's algorithm, our algorithm does not require the group
APA, Harvard, Vancouver, ISO, and other styles
4

Devitt, S. J., A. G. Fowler, and L. C. L. Hollenberg. "Robustness of Shor's algorithm." Quantum Information and Computation 6, no. 7 (2006): 616–29. http://dx.doi.org/10.26421/qic6.7-5.

Full text
Abstract:
Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations of an appropriate quantum circuit, we show that the error locations within the circuit itself heavily influences the probability of success of the QPF subroutine. The results also indicate that t
APA, Harvard, Vancouver, ISO, and other styles
5

Akbar, Rahmad, Bambang Pramono, and Rizal Adi Saputra. "Implementasi Algoritma Simon Pada Aplikasi Kamus Perubahan Fi’il (Kata Kerja Bahasa Arab) Berbasis Android." Ultimatics : Jurnal Teknik Informatika 13, no. 1 (2021): 12–18. http://dx.doi.org/10.31937/ti.v13i1.1850.

Full text
Abstract:
Kata kunci—Algoritma String Matching, Algoritma Simon, Kamus Perubahan Fi’il Android
 
 Ilmu Shorof atau Tashrif adalah bidang keilmuan derivasi kata dalam Bahasa Arab, salah satu fokus pembahasan bidang ilmu tersebut ialah proses perubahan kata kerja atau disebut juga dengan Fi’il menjadi beberapa jenis kata yang lain, seperti Fi’il Mudhori’, Fi’il Madhi, Fi’il Amr, Fi’il Nahi, Isim Fa’il, Isim Maf’ul, Isim Zaman, Isim Makan, Isim Alat, Masdar maupun Masdar mim. Proses pembelajaran ilmu Shorof masih banyak dilakukan dengan cara tradisional, terutama dilingkungan pesantren dengan car
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Ye-Chao, Jiangwei Shang, and Xiangdong Zhang. "Coherence Depletion in Quantum Algorithms." Entropy 21, no. 3 (2019): 260. http://dx.doi.org/10.3390/e21030260.

Full text
Abstract:
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover’s algorithm, Deutsch–Jozsa algorithm, and Shor’s algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar co
APA, Harvard, Vancouver, ISO, and other styles
7

Kendon, V. M., and W. J. Munro. "Entanglement and its role in Shor's algorithm." Quantum Information and Computation 6, no. 7 (2006): 630–40. http://dx.doi.org/10.26421/qic6.7-6.

Full text
Abstract:
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their classical counterparts. The nature of this resource is still not fully understood: here we use numerical simulation to investigate how entanglement between register qubits varies as Shor's algorithm is run on a quantum computer. The shifting patterns in the entanglement are found to relate to the choice of basis for the quantum Fourier transform.
APA, Harvard, Vancouver, ISO, and other styles
8

Savran, I., M. Demirci, and A. H. Yılmaz. "Accelerating Shor’s factorization algorithm on GPUs." Canadian Journal of Physics 96, no. 7 (2018): 759–61. http://dx.doi.org/10.1139/cjp-2017-0768.

Full text
Abstract:
Shor’s quantum algorithm is very important for cryptography, because it can factor large numbers much faster than classical algorithms. In this study, we implement a simulator for Shor’s quantum algorithm on graphic processor units (GPU) and compare our results with Liquid, which is a Microsoft quantum simulation platform, and two classical CPU implementations. We evaluate 10 benchmarks for comparing our GPU implementation with Liquid and single-core implementation. The analysis shows that GPU vector operations are more suitable for Shor’s quantum algorithm. Our GPU kernel function is compute-
APA, Harvard, Vancouver, ISO, and other styles
9

GAWRON, P., and J. A. MISZCZAK. "NUMERICAL SIMULATIONS OF MIXED STATE QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 01 (2005): 195–99. http://dx.doi.org/10.1142/s0219749905000748.

Full text
Abstract:
We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations — partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. A simulation of Shor's algorithm is presented as an example of package capabilities.
APA, Harvard, Vancouver, ISO, and other styles
10

Muruganantham, B., P. Shamili, S. Ganesh Kumar, and A. Murugan. "Quantum cryptography for secured communication networks." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 1 (2020): 407. http://dx.doi.org/10.11591/ijece.v10i1.pp407-414.

Full text
Abstract:
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum c
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Shorův algoritmus"

1

Nwaokocha, Martyns. "Shorův algoritmus v kvantové kryptografii." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-445457.

Full text
Abstract:
Kryptografie je velmi důležitým aspektem našeho každodenního života, protože poskytuje teoretický základ informační bezpečnosti. Kvantové výpočty a informace se také stávají velmi důležitou oblastí vědy kvůli mnoha aplikačním oblastem včetně kryptologie a konkrétněji v kryptografii veřejných klíčů. Obtížnost čísel do hlavních faktorů je základem některých důležitých veřejných kryptosystémů, jejichž klíčem je kryptosystém RSA . Shorův kvantový faktoringový al-goritmus využívá zejména kvantový interferenční účinek kvantového výpočtu k faktorovým semi-prime číslům v polynomiálním čase na kvantové
APA, Harvard, Vancouver, ISO, and other styles
2

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Full text
Abstract:
<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro
APA, Harvard, Vancouver, ISO, and other styles
3

Kugel, Felix. "Das Shor-Verfahren als stochastischer Algorithmus." [S.l.] : [s.n.], 2006. http://137.193.200.177/ediss/kugel-felix/meta.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Thakkar, Darshan Suresh, and darshanst@gmail com. "FPGA Implementation of Short Word-Length Algorithms." RMIT University. Electrical and Computer Engineering, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080806.140908.

Full text
Abstract:
Short Word-Length refers to single-bit, two-bit or ternary processing systems. SWL systems use Sigma-Delta Modulation (SDM) technique to express an analogue or multi-bit input signal in terms of a high frequency single-bit stream. In Sigma-Delta Modulation, the input signal is coarsely quantized into a single-bit representation by sampling it at a much higher rate than twice the maximum input frequency viz. the Nyquist rate. This single-bit representation is almost exclusively filtered to remove conversion quantization noise and sample decimated to the Nyquist frequency in preparation for t
APA, Harvard, Vancouver, ISO, and other styles
5

Bandini, Michele. "Crittografia quantistica e algoritmo di Shor." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17073/.

Full text
Abstract:
In questo elaborato si cerca di dare un'idea di come funzioni un computer quantistico, portando come esempio l'Algoritmo di Shor per la fattorizzazione: si cerca di chiarirne la matematica e la fisica che vi stanno dietro e l'importanza applicativa e storica che ha avuto. Brevi cenni sull'odierna tecnologia dei calcolatori quantistici.
APA, Harvard, Vancouver, ISO, and other styles
6

Schilling, Gordian Hansjoerg. "Algorithms for short-term and periodic process scheduling and rescheduling." Thesis, Imperial College London, 1998. http://hdl.handle.net/10044/1/7696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Feng, Wenlan. "Modelling market demand and manufacturing response using genetic algorithms." Thesis, Glasgow Caledonian University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Drobouchevitch, Inna G. "Design and analysis of algorithms for short-route shop scheduling problems." Thesis, University of Greenwich, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285392.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Healy, Cornelius Thomas. "Short-length low-density parity-check codes : construction and decoding algorithms." Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/7875/.

Full text
Abstract:
Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying t
APA, Harvard, Vancouver, ISO, and other styles
10

Resende, Diogo Soares. "Ferramenta trifásica para síntese e análise da proteção em sistemas desequilibrados." Universidade Federal de Juiz de Fora (UFJF), 2016. https://repositorio.ufjf.br/jspui/handle/ufjf/3134.

Full text
Abstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-01-09T16:42:49Z No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5)<br>Approved for entry into archive by Diamantino Mayra (mayra.diamantino@ufjf.edu.br) on 2017-01-31T11:22:04Z (GMT) No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5)<br>Made available in DSpace on 2017-01-31T11:22:04Z (GMT). No. of bitstreams: 1 diogosoaresresende.pdf: 5068811 bytes, checksum: e6f520585ffef78e123573bd1e41ff4d (MD5) Previous issue da
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Shorův algoritmus"

1

Asquith, Paul. Short sales and trade classification algorithms. National Bureau of Economic Research, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Burstein, Joseph. Exact numerical solutions of nonlinear differential equations, short algorithms: After three centuries of approximate methods. Metrics Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1974-, Zomorodian Afra J., ed. Advances in applied and computational topology: American Mathematical Society Short Course on Computational Topology, January 4-5, 2011, New Orleans, Louisiana. American Mathematical Society, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tschinkel, Yuri, Carlo Gasbarri, Steven Lu, and Mike Roth. Rational points, rational curves, and entire holomorphic curves on projective varieties: CRM short thematic program, June 3-28, 2013, Centre de Recherches Mathematiques, Universite de Montreal, Quebec, Canada. American Mathematical Society, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United States. National Aeronautics and Space Administration., ed. Development, refinement and testing of a short term solar flare pR[sic]ediction algorithm: Progress report, August 1992 - February, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Priest, Graham. Logic: A Very Short Introduction. Oxford University Press, 2017. http://dx.doi.org/10.1093/actrade/9780198811701.001.0001.

Full text
Abstract:
Logic is often perceived as having little to do with the rest of philosophy, and even less to do with real life. Logic: A Very Short Introduction shows how wrong this conception is. It explores the philosophical roots of the subject, explaining how modern formal logic deals with issues ranging from the existence of God and the reality of time to paradoxes of probability and decision theory. Along the way, the basics of formal logic are explained in simple, non-technical terms, showing that logic is a powerful and exciting part of modern philosophy. It also covers the subjects of algorithms and
APA, Harvard, Vancouver, ISO, and other styles
9

Voit, Eberhard O. Systems Biology: A Very Short Introduction. Oxford University Press, 2020. http://dx.doi.org/10.1093/actrade/9780198828372.001.0001.

Full text
Abstract:
Systems biology came about as growing numbers of scientists and engineers from different fields created experimental methods and algorithms that supported the analysis of very large quantities of biological data. Systems Biology: A Very Short Introduction outlines the exciting processes and possibilities in this new field. It describes how modern biology enabled us to learn how intricately the expression of every gene is controlled, how signalling systems keep organisms running smoothly, how complicated even the simplest cells are, and how computational methods may help us understand these co
APA, Harvard, Vancouver, ISO, and other styles
10

John F. Kennedy Space Center., ed. Development of algorithms and error analyses for the short baseline lightning detection and ranging system. National Aeronautics and Space Administration, John F. Kennedy Space Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Shorův algoritmus"

1

Bläser, Markus, and Bodo Siebert. "Computing Cycle Covers without Short Cycles." In Algorithms — ESA 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44676-1_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fishkin, Aleksei V. "Disk Graphs: A Short Survey." In Approximation and Online Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24592-6_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Stetsyuk, Petro I. "Shor’s r-Algorithms: Theory and Practice." In Optimization Methods and Applications. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68640-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liebchen, Christian. "Finding Short Integral Cycle Bases for Cyclic Timetabling." In Algorithms - ESA 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39658-1_64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Elyash, Igor G. "Management of Short Bowel Syndrome." In Clinical Algorithms in General Surgery. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-98497-1_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mäkinen, Veli, Niko Välimäki, Antti Laaksonen, and Riku Katainen. "Unified View of Backward Backtracking in Short Read Mapping." In Algorithms and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12476-1_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liang, Jie, and Ronald Jackups. "Sequence and Spatial Motif Discovery in Short Sequence Fragments." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liang, Jie, and Ronald Jackups. "Sequence and Spatial Motif Discovery in Short Sequence Fragments." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_601-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Park, Kyewon Koh. "A Short Proof of Even α-Equivalence." In Algorithms, Fractals, and Dynamics. Springer US, 1995. http://dx.doi.org/10.1007/978-1-4613-0321-3_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Danda, Umesh Sandeep, G. Ramakrishna, Jens M. Schmidt, and M. Srikanth. "On Short Fastest Paths in Temporal Graphs." In WALCOM: Algorithms and Computation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68211-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Shorův algoritmus"

1

Maknickienė, Nijolė, and Kristina Miškinytė. "SKAITMENINIŲ VALIUTŲ KAINŲ PROGNOZAVIMAS NAUDOJANT GILIOJO MOKYMOSI ALGORITMĄ." In 23rd Conference for Young Researchers "Economics and Management". Vilnius Gediminas Technical University, 2020. http://dx.doi.org/10.3846/vvf.2020.033.

Full text
Abstract:
Kriptovaliutos vis dar yra finansų rinkos naujovė ir iki galo neištirta finansinis instrumentas. Tai išlaiko kriptovaliutas įdomia ir aktualia tema, tiek mokslininkams, tiek reguliacinėms institucijoms bei investuotojams. Kriptovaliutų rinka yra auganti, nestabili ir nuolat besikeičianti, kas suteikia jai aukštą riziką ir plačias galimybes. Finansinis išmanymas ir toliaregiškas prognozavimas, nepasimetant pinigų vertės, rizikos ir nenuspėjamumo chaose yra ypač svarbus šiandieninėje ekonomikoje. Sudėtingas kriptovaliutų rinkos pobūdis reikalauja plataus profilio duomenų kiekio, kuriam apdoroti
APA, Harvard, Vancouver, ISO, and other styles
2

CHOFFRUT, CHRISTIAN. "A SHORT INTRODUCTION TO AUTOMATIC GROUP THEORY." In Semigroups, Algorithms, Automata and Languages. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776884_0004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

"De Novo Short Read Assembly Algorithm with Low Memory Usage." In International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and and Technology Publications, 2014. http://dx.doi.org/10.5220/0004881002150220.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sharma, Shashank, and Ankit Singhal. "De-Novo Assembly of Short Reads in Minimal Overlap Model." In International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and and Technology Publications, 2015. http://dx.doi.org/10.5220/0005214100440054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

"The Distribution of Short Word Match Counts between Markovian Sequences." In International Conference on Bioinformatics Models, Methods and Algorithms. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004203700250033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mucha, Marcin. "Lyndon Words and Short Superstrings." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Castillo, K., and F. R. Rafaeli. "A short note on interlacing and monotonicity of zeros of orthogonal polynomials." In NUMERICAL COMPUTATIONS: THEORY AND ALGORITHMS (NUMTA–2016): Proceedings of the 2nd International Conference “Numerical Computations: Theory and Algorithms”. Author(s), 2016. http://dx.doi.org/10.1063/1.4965368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bremler-Barr, Anat, Yotam Harchol, David Hay, and Yacov Hel-Or. "Encoding Short Ranges in TCAM Without Expansion." In SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 2016. http://dx.doi.org/10.1145/2935764.2935769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Feng, X., Z. Meng, and I. H. Sudborough. "Improved upper bound for sorting by short swaps." In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300465.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kirousis, Lefteris. "Coloring Random Graphs: A Short Survey." In 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2009. http://dx.doi.org/10.1109/synasc.2009.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Shorův algoritmus"

1

Asquith, Paul, Rebecca Oman, and Christopher Safaya. Short Sales and Trade Classification Algorithms. National Bureau of Economic Research, 2008. http://dx.doi.org/10.3386/w14158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Plimpton, S. Fast parallel algorithms for short-range molecular dynamics. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10176421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cable, S., T. Tajima, and K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/6970874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cable, S., T. Tajima, and K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/10181739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Allende López, Marcos, Diego López, Sergio Cerón, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH
APA, Harvard, Vancouver, ISO, and other styles
6

Downard, Alicia, Stephen Semmens, and Bryant Robbins. Automated characterization of ridge-swale patterns along the Mississippi River. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/40439.

Full text
Abstract:
The orientation of constructed levee embankments relative to alluvial swales is a useful measure for identifying regions susceptible to backward erosion piping (BEP). This research was conducted to create an automated, efficient process to classify patterns and orientations of swales within the Lower Mississippi Valley (LMV) to support levee risk assessments. Two machine learning algorithms are used to train the classification models: a convolutional neural network and a U-net. The resulting workflow can identify linear topographic features but is unable to reliably differentiate swales from o
APA, Harvard, Vancouver, ISO, and other styles
7

Ruiz, Pablo, Craig Perry, Alejando Garcia, et al. The Everglades National Park and Big Cypress National Preserve vegetation mapping project: Interim report—Northwest Coastal Everglades (Region 4), Everglades National Park (revised with costs). National Park Service, 2020. http://dx.doi.org/10.36967/nrr-2279586.

Full text
Abstract:
The Everglades National Park and Big Cypress National Preserve vegetation mapping project is part of the Comprehensive Everglades Restoration Plan (CERP). It is a cooperative effort between the South Florida Water Management District (SFWMD), the United States Army Corps of Engineers (USACE), and the National Park Service’s (NPS) Vegetation Mapping Inventory Program (VMI). The goal of this project is to produce a spatially and thematically accurate vegetation map of Everglades National Park and Big Cypress National Preserve prior to the completion of restoration efforts associated with CERP. T
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!