Relevant bibliographies by topics / Euclidean algorithm / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Euclidean algorithm.

Dissertations / Theses on the topic 'Euclidean algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Euclidean algorithm.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Hirata, Tomio. "VLSI Algorithm for Euclidean Distance Transform." INTELLIGENT MEDIA INTEGRATION NAGOYA UNIVERSITY / COE, 2004. http://hdl.handle.net/2237/10354.

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

SILVA, Alecio Soares. "Um Estudo Sobre Aplicação do Algoritmo de Euclides." Universidade Federal de Campina Grande, 2014. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/2160.

Full text
Abstract:
Submitted by Emanuel Varela Cardoso (emanuel.varela@ufcg.edu.br) on 2018-11-09T17:51:39Z No. of bitstreams: 1 ALECIO SOARES SILVA – DISSERTAÇÃO (PPGMat) 2014.pdf: 873139 bytes, checksum: 9a35db2563d66eb36f4dabfe6e5cd45e (MD5)<br>Made available in DSpace on 2018-11-09T17:51:39Z (GMT). No. of bitstreams: 1 ALECIO SOARES SILVA – DISSERTAÇÃO (PPGMat) 2014.pdf: 873139 bytes, checksum: 9a35db2563d66eb36f4dabfe6e5cd45e (MD5) Previous issue date: 2014-08<br>Capes<br>Neste trabalho consideramos o uso de algoritmo de Euclides com o intuito de aplicá-lo de uma forma interdisciplinar. Para atingir este
APA, Harvard, Vancouver, ISO, and other styles
3

Clark, David Alan. "The Euclidean algorithm for Galois extensions of the rational numbers." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=39408.

Full text
Abstract:
Let K be a totally real, quartic, Galois extension of $ doubq$ whose ring of integers R is a principal ideal domain. If there is a prime ideal p of R such that the unit group maps onto $(R/{ bf p} sp2$)*, then R is a Euclidean domain. This criterion is generalized to arbitrary Galois extensions.<br>Let E be an elliptic curve over a number field F. Suppose ($F: doubq rbrack le 4$ and $F(E lbrack q rbrack ) not subseteq F$ for all primes q such that F contains a primitive $q sp{ rm th}$ root of unity, then the reduced elliptic curve $ tilde{E}(F sb{ bf p})$ is cyclic infinitely often. In general
APA, Harvard, Vancouver, ISO, and other styles
4

高木, 直史, and Naofumi Takagi. "A VLSI algorithm for computing the Euclidean norm of a 3D vector." IEEE, 2000. http://hdl.handle.net/2237/5291.

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

Zegeye, Wondimu K., and Seifemichael B. Amsalu. "Minimum Euclidean Distance Algorithm for Indoor WiFi Received Signal Strength (RSS) Fingerprinting." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624190.

Full text
Abstract:
While WiFi-based indoor localization is attractive, the need for a significant degree of pre-deployment effort is a key challenge. In this paper, indoor localization with no pre-deployment effort in an indoor space, such as an office building corridor, with WiFi coverage but no apriori knowledge of the placement of the access points(APs) is implemented for mobile devices. WiFi Received Signal Strength(RSS) in the considered environment is used to build radio maps using WiFi fingerprinting approach. Two architectures are developed based on this localization algorithm. The first one involve
APA, Harvard, Vancouver, ISO, and other styles
6

Crook, Deborah. "Polynomial invariants of the Euclidean group action on multiple screws : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Master of Science in Mathematics /." ResearchArchive@Victoria e-Thesis, 2009. http://hdl.handle.net/10063/1205.

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

Hilmar, Jan. "Intersection of algebraic plane curves : some results on the (monic) integer transfinite diameter." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/3843.

Full text
Abstract:
Part I discusses the problem of determining the set of intersection points, with corresponding multiplicities, of two algebraic plane curves. We derive an algorithm based on the Euclidean Algorithm for polynomials and show how to use it to find the intersection points of two given curves. We also show that an easy proof of Bézout’s Theorem follows. We then discuss how, for curves with rational coefficients, this algorithm can bemodified to find the intersection points with coordinates expressed in terms of algebraic extensions of the rational numbers. Part II deals with the problem of determi
APA, Harvard, Vancouver, ISO, and other styles
8

Smith, Andrea Marie. "A dual algorithm for the weighted Euclidean distance min-max location problem in R² and R³." Connect to this title online, 2009. http://etd.lib.clemson.edu/documents/1246559571/.

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

Franco, Felipe Barbosa. "O jogo dominó algébrico." Universidade Federal de Goiás, 2018. http://repositorio.bc.ufg.br/tede/handle/tede/8622.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2018-06-29T10:56:16Z No. of bitstreams: 2 Dissertação - Felipe Barbosa Franco - 2018.pdf: 2597060 bytes, checksum: b4c3ff56766b29c5a01cd7de1c3ba60a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-06-29T11:55:57Z (GMT) No. of bitstreams: 2 Dissertação - Felipe Barbosa Franco - 2018.pdf: 2597060 bytes, checksum: b4c3ff56766b29c5a01cd7de1c3ba60a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Made ava
APA, Harvard, Vancouver, ISO, and other styles
10

Ranjitkar, Hari Sagar, and Sudip Karki. "Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man." Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800.

Full text
Abstract:
Context An influence map and potential fields are used for finding path in domain of Robotics and Gaming in AI. Various distance measures can be used to find influence maps and potential fields. However, these distance measures have not been compared yet. ObjectivesIn this paper, we have proposed a new algorithm suitable to find an optimal point in parameters space from random parameter spaces. Finally, comparisons are made among three popular distance measures to find the most efficient. Methodology For our RQ1 and RQ2, we have implemented a mix of qualitative and quantitative approach and fo
APA, Harvard, Vancouver, ISO, and other styles
11

Campos, Adilson de. "EQUAÇÕES DIOFANTINAS LINEARES: POSSIBILIDADES DIDÁTICAS USANDO A RESOLUÇÃO DE PROBLEMAS." Universidade Federal de Santa Maria, 2015. http://repositorio.ufsm.br/handle/1/10945.

Full text
Abstract:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>This work presents an educational experiment carried out in a 9th grade class of elementary school, in order to assess the didactic and pedagogical possibilities involving the Linear Diophantine Equations theme, with the contextual support of Problem Solving. This application intends to expand the students' conceptions in arithmetic and algebra courses, also providing a concrete possibility of applicability of the greatest common divisor of two integers, a very neglected theme throughout the elementary school. In a level of element
APA, Harvard, Vancouver, ISO, and other styles
12

PRAZERES, Sidmar Bezerra dos. "O Teorema chinês dos restos e a partilha de senhas." Universidade Federal Rural de Pernambuco, 2014. http://www.tede2.ufrpe.br:8080/tede2/handle/tede2/6709.

Full text
Abstract:
Submitted by (lucia.rodrigues@ufrpe.br) on 2017-03-29T14:30:56Z No. of bitstreams: 1 Sidmar Bezerra dos Prazeres.pdf: 511759 bytes, checksum: cf327985c0961f16751448a107717241 (MD5)<br>Made available in DSpace on 2017-03-29T14:30:56Z (GMT). No. of bitstreams: 1 Sidmar Bezerra dos Prazeres.pdf: 511759 bytes, checksum: cf327985c0961f16751448a107717241 (MD5) Previous issue date: 2014-06-16<br>This paper aims to show the reader the importance of some topics of Number Theory. Work here, and prerequisites (Euclid Algorithms, Divisibility, Maxim Common Divisor), content with Linear Diophantine equ
APA, Harvard, Vancouver, ISO, and other styles
13

Filip, Silviu-Ioan. "Robust tools for weighted Chebyshev approximation and applications to digital filter design." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSEN063/document.

Full text
Abstract:
De nombreuses méthodes de traitement du signal reposent sur des résultats puissants d'approximation numérique. Un exemple significatif en est l'utilisation de l'approximation de type Chebyshev pour l'élaboration de filtres numériques.En pratique, le caractère fini des formats numériques utilisés en machine entraîne des difficultés supplémentaires pour la conception de filtres numériques (le traitement audio et le traitement d'images sont deux domaines qui utilisent beaucoup le filtrage). La majorité des outils actuels de conception de filtres ne sont pas optimisés et ne certifient pas non plus
APA, Harvard, Vancouver, ISO, and other styles
14

Hanley, Jodi Ann. "Egyptian fractions." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2323.

Full text
Abstract:
Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception, by the Egyptians, of 2/3. Egyptian fractions have actually played an important part in mathematics history with its primary roots in number theory. This paper will trace the history of Egyptian fractions by starting at the time of the Egyptians, working our way to Fibonacci, a geologist named Farey, continued fractions, Diophantine equations, and unsolved problems in number theory.
APA, Harvard, Vancouver, ISO, and other styles
15

Nascimento, Amanda Melo do. "Frações contínuas e aplicações no ensino médio." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3678.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-24T11:32:03Z No. of bitstreams: 2 Mestrado - Amanda Melo do Nascimento - 2013.pdf: 1240146 bytes, checksum: 0126ba6aa1a69a061f1ffabfaf21e9be (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2014-11-24T14:00:24Z (GMT) No. of bitstreams: 2 Mestrado - Amanda Melo do Nascimento - 2013.pdf: 1240146 bytes, checksum: 0126ba6aa1a69a061f1ffabfaf21e9be (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<b
APA, Harvard, Vancouver, ISO, and other styles
16

Daneshbeh, Amir. "Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2m)." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/776.

Full text
Abstract:
Systolic architectures are capable of achieving high throughput by maximizing pipelining and by eliminating global data interconnects. Recursive algorithms with regular data flows are suitable for systolization. The computation of multiplicative inversion using algorithms based on EEA (Extended Euclidean Algorithm) are particularly suitable for systolization. Implementations based on EEA present a high degree of parallelism and pipelinability at bit level which can be easily optimized to achieve local data flow and to eliminate the global interconnects which represent most important bot
APA, Harvard, Vancouver, ISO, and other styles
17

Šicner, Jiří. "Srovnání algoritmů dekódování Reed-Solomonova kódu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219300.

Full text
Abstract:
The work deals with the encoding and decoding of Reed-Solomon codes. There is generally described algebraic decoding of Reed-Solomon codes, and then described four methods of decoding, namely Massey-Berlekamp algorithm, Euclidean algoritus, Peterson-Gorenstein-Zierler algorithm and the direct method. These methods are then compared, and some of them are implemented in Matlab.
APA, Harvard, Vancouver, ISO, and other styles
18

Oliveira, Marcos Antônio Almeida de. "Heurística aplicada ao problema árvore de Steiner Euclidiano com representação nó-profundidade-grau." Universidade Federal de Goiás, 2014. http://repositorio.bc.ufg.br/tede/handle/tede/4171.

Full text
Abstract:
Submitted by Luanna Matias (lua_matias@yahoo.com.br) on 2015-02-06T19:23:12Z No. of bitstreams: 2 Dissertação - Marcos Antônio Almeida de Oliveira - 2014..pdf: 1092566 bytes, checksum: 55edbdaf5b3ac84fe3f6835682fe2a13 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-02-19T14:34:20Z (GMT) No. of bitstreams: 2 Dissertação - Marcos Antônio Almeida de Oliveira - 2014..pdf: 1092566 bytes, checksum: 55edbdaf5b3ac84fe3f6835682fe2a13 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac95
APA, Harvard, Vancouver, ISO, and other styles
19

Frolka, Jakub. "BCH kódy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219462.

Full text
Abstract:
The work deals with data security using BCH codes. In the work are described BCH codes in binary and non-binary form, and their most important subclass RS codes. Furthermore, this work describes the method of decoding Peterson-Gorenstein-Zierl, Berlekamp- Massey and Euclidean algorithm. For the presentation of encoding and decoding process, the application was created in Matlab, which has two parts – Learning BCH codes and Simulation of BCH codes. Using the generated application performance of BCH codes was compared at the last part of the work.
APA, Harvard, Vancouver, ISO, and other styles
20

Choudhury, Sabyasachy. "Hierarchical Data Structures for Pattern Recognition." Thesis, Indian Institute of Science, 1987. https://etd.iisc.ac.in/handle/2005/74.

Full text
Abstract:
Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches: 1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n
APA, Harvard, Vancouver, ISO, and other styles
21

Choudhury, Sabyasachy. "Hierarchical Data Structures for Pattern Recognition." Thesis, Indian Institute of Science, 1987. http://hdl.handle.net/2005/74.

Full text
Abstract:
Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches: 1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n)
APA, Harvard, Vancouver, ISO, and other styles
22

Melo, Cleilton Bezerra de. "A matemÃtica dos restos e o calendÃrio gregoriano." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=12437.

Full text
Abstract:
nÃo hÃ<br>Esta obra tem como objetivo principal, mostrar que sempre à possÃvel buscar uma nova forma de abordar determinados conteÃdos matemÃticos, de maneira mais simples, clara e interessante contribuindo para uma melhoria na educaÃÃo dos discentes. Mostraremos a existÃncia de formas inovadoras de se trabalhar com a matemÃtica, em particular foi desenvolvido um estudo sobre a matemÃtica envolvida no calendÃrio Gregoriano, veremos quais as relaÃÃes entre os dias da semana e dos meses e/ou anos. A nossa principal ferramenta matemÃtica utilizada neste trabalho à a divisÃo Euclidiana. Estudaremo
APA, Harvard, Vancouver, ISO, and other styles
23

Angeletti, Mélodie. "Traitement de données multi-spectrales par calcul intensif et applications chez l'homme en imagerie par résonnance magnétique nucléaire." Thesis, Université Clermont Auvergne‎ (2017-2020), 2019. http://www.theses.fr/2019CLFAC004/document.

Full text
Abstract:
L'imagerie par résonance magnétique fonctionnelle (IRMf) étant une technique non invasive pour l'étude de cerveau, elle a été employée pour comprendre les mécanismes cérébraux sous-jacents à la prise alimentaire. Cependant, l'utilisation de stimuli liquides pour simuler la prise alimentaire engendre des difficultés supplémentaires par rapport aux stimulations visuellement habituellement mises en œuvre en IRMf. L'objectif de cette thèse a donc été de proposer une méthode robuste d'analyse des données tenant compte de la spécificité d'une stimulation alimentaire. Pour prendre en compte le mouvem
APA, Harvard, Vancouver, ISO, and other styles
24

Пальчик, О. О. "Комп'ютерна реалізація методів рішення діофантових рівнянь". Master's thesis, Сумський державний університет, 2018. http://essuir.sumdu.edu.ua/handle/123456789/72319.

Full text
Abstract:
Реалізовано програмний засіб для рішення діофантового рівняння, розроблений на мові C# в середовищі програмування Microsoft Visual Studio Community 2017. Функціональне моделювання програмного засобу виконано на базі технології SADT. Проектування програмного продукту виконано в нотації UML.
APA, Harvard, Vancouver, ISO, and other styles
25

Figueiredo, Fabio Dalla Costa. "Alguns problemas em geometrias de curvas." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276211.

Full text
Abstract:
Orientador: Pedro Jussieu de Rezende<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-06T03:40:47Z (GMT). No. of bitstreams: 1 Figueiredo_FabioDallaCosta_M.pdf: 1782158 bytes, checksum: fa8eb774d4870ff779afab7b7041759f (MD5) Previous issue date: 2005<br>Resumo: Problemas de natureza geométrica são encontrados em diversas áreas e, portanto, a análise dos mesmos sob uma ótica algorítmica e imprescindível. Não obstante um amplo tratamento de problemas na geometria euclidiana, relativamente poucos estudos foram feitos e
APA, Harvard, Vancouver, ISO, and other styles
26

Riddell, A. G. "Computer algorithms for Euclidean lattice gauge theory calculations." Thesis, University of Canterbury. Physics, 1988. http://hdl.handle.net/10092/8220.

Full text
Abstract:
The computer algorithm devised by K. Decker [25] for the calculation of strong coupling expansions in Euclidean lattice gauge theory is reviewed. Various shortcomings of this algorithm are pointed out and an improved algorithm is developed. The new algorithm does away entirely with the need to store large amounts of information, and is designed in such a way that memory useage is essentially independant of the order to which the expansion is being calculated. A good deal of the redundancy and double handling present in the algorithm of ref. [25] is also eliminated. The algorithm has been used
APA, Harvard, Vancouver, ISO, and other styles
27

Lezowski, Pierre. "Questions d’euclidianité." Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14642/document.

Full text
Abstract:
Nous étudions l'euclidianité des corps de nombres pour la norme et quelques unes de ses généralisations. Nous donnons en particulier un algorithme qui calcule le minimum euclidien d'un corps de nombres de signature quelconque. Cela nous permet de prouver que de nombreux corps sont euclidiens ou non pour la norme. Ensuite, nous appliquons cet algorithme à l'étude des classes euclidiennes pour la norme, ce qui permet d'obtenir de nouveaux exemples de corps de nombres avec une classe euclidienne non principale. Par ailleurs, nous déterminons tous les corps cubiques purs avec une classe euclidienn
APA, Harvard, Vancouver, ISO, and other styles
28

Dahlin, Mathilda. "Avkodning av cykliska koder - baserad på Euklides algoritm." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-48248.

Full text
Abstract:
Today’s society requires that transformation of information is done effectively and correctly. In other words, the received message must correspond to the message being sent. There are a lot of decoding methods to locate and correct errors. The main purpose in this degree project is to study one of these methods based on the Euclidean algorithm. Thereafter an example will be illustrated showing how the method is used when decoding a three - error correcting BCH code. To begin with, fundamental concepts about coding theory are introduced. Secondly, linear codes, cyclic codes and BCH codes - in
APA, Harvard, Vancouver, ISO, and other styles
29

Abu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices." Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.

Full text
Abstract:
Data security will play a central role in the design of future IT systems. The PC has been a major driver of the digital economy. Recently, there has been a shift towards IT applications realized as embedded systems, because they have proved to be good solutions for many applications, especially those which require data processing in real time. Examples include security for wireless phones, wireless computing, pay-TV, and copy protection schemes for audio/video consumer products and digital cinemas. Most of these embedded applications will be wireless, which makes the communication channel vul
APA, Harvard, Vancouver, ISO, and other styles
30

Van, Laarhoven Jon William. "Exact and heuristic algorithms for the Euclidean Steiner tree problem." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/755.

Full text
Abstract:
In this thesis, we study the Euclidean Steiner tree problem (ESTP) which arises in the field of combinatorial optimization. The ESTP asks for a network of minimal total edge length spanning a set of given terminal points in Rd with the ability to add auxiliary connecting points (Steiner points) to decrease the overall length of the network. The graph theory literature contains extensive studies of exact, approximation, and heuristic algorithms for ESTP in the plane, but less is known in higher dimensions. The contributions of this thesis include a heuristic algorithm and enhancements to an exa
APA, Harvard, Vancouver, ISO, and other styles
31

Caixeta, Susiane Bezerra. "Algoritmo da divisão de Euclides." reponame:Repositório Institucional da UnB, 2016. http://repositorio.unb.br/handle/10482/21158.

Full text
Abstract:
Dissertação (mestrado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Matemática, Programa de Mestrado Profissional em Matemática em Rede Nacional, 2016.<br>Submitted by Fernanda Percia França (fernandafranca@bce.unb.br) on 2016-07-07T20:49:35Z No. of bitstreams: 1 2016_SusianeBezerraCaixeta.pdf: 643998 bytes, checksum: 07d398db307ed1fb444bd4ba0b09f637 (MD5)<br>Approved for entry into archive by Raquel Viana(raquelviana@bce.unb.br) on 2016-08-03T22:08:29Z (GMT) No. of bitstreams: 1 2016_SusianeBezerraCaixeta.pdf: 643998 bytes, checksum: 07d398db307ed1fb444bd4ba0b09f63
APA, Harvard, Vancouver, ISO, and other styles
32

Bértolo, Mónica Calvário. "Inteiros Gaussianos." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/16826.

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

Al-Loughani, Intesar Mansour. "Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30694.

Full text
Abstract:
This dissertation is concerned with the development of algorithmic approaches for solving the minisum location and location-allocation problems in which the Euclidean metric is used to measure distances. To overcome the nondifferentiability difficulty associated with the Euclidean norm function, specialized solution procedures are developed for both the location and the location-allocation problems. For the multifacility location problem (EMFLP), two equivalent convex differentiable reformulations are proposed. The first of these is formulated directly in the primal space, and relationships be
APA, Harvard, Vancouver, ISO, and other styles
34

Daireaux, Benoît. "Analyse des algorithmes d'Euclide : une approche dynamique." Caen, 2005. http://www.theses.fr/2005CAEN2009.

Full text
Abstract:
Les objets étudiés dans cette thèse sont des algorithmes de calcul de pgcd. Nous effectuons dans cette thèse des analyses probabilistes de plusieurs de ces algorithmes : les algorithmes alpha-euclidiens, l'algorithme LSB et l'algorithme de Lehmer-Euclide. Nous obtenons des résultats précis sur le comportement moyen de toute une gamme de paramètres, entre autres le nombre d'itérations et la complexité en bits. Les techniques employées sont celles de l'analyse dynamique d'algorithmes, et les analyses effectuées dans cette thèse permettent d'élargir le champ d'application de cette méthodologie. E
APA, Harvard, Vancouver, ISO, and other styles
35

Rezende, Germano Abud de 1977. "Explorando a dualidade em geometria de distâncias." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306801.

Full text
Abstract:
Orientador: Carlile Campos Lavor<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica<br>Made available in DSpace on 2018-08-25T18:42:28Z (GMT). No. of bitstreams: 1 Rezende_GermanoAbudde_D.pdf: 1418033 bytes, checksum: 61d29b02274278ede5ffca797e26371a (MD5) Previous issue date: 2014<br>Resumo: A geometria de distâncias é o estudo da geometria baseado no conceito de distância. Ela é útil em várias aplicações, onde os dados de entrada consistem de um conjunto incompleto de distâncias, e a saída é um conjunto de pontos no espaço
APA, Harvard, Vancouver, ISO, and other styles
36

Vera, Antonio. "Analyses de l'algorithme de Gauss : applications à l'analyse de l'algorithme LLL." Phd thesis, Université de Caen, 2009. http://tel.archives-ouvertes.fr/tel-01073359.

Full text
Abstract:
Cette thèse est dédiée à l'analyse probabiliste d'algorithmes de réduction des réseaux euclidiens. Un réseau euclidien est l'ensemble de combinaisons linéaires à coefficients entiers d'une base (b_1,..., b_n ) \subset R^n. La réduction d'un réseau consiste a en trouver une base formée de vecteurs assez courts et assez orthogonaux, à partir d'une base donnée en entrée. Le célèbre algorithme LLL résout ce problème de manière efficace en dimension arbitraire. Il est très utilisé, mais mal compris. Nous nous concentrons sur son analyse dans le cas n = 2, où LLL devient l'algorithme de Gauss, car c
APA, Harvard, Vancouver, ISO, and other styles
37

Godeme, Jean-Jacques. "Ρhase retrieval with nοn-Euclidean Bregman based geοmetry". Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMC214.

Full text
Abstract:
Dans ce travail, nous nous intéressons au problème de reconstruction de phase de signaux à valeurs réelles en dimension finie, un défi rencontré dans de nombreuses disciplines scientifiques et d’ingénierie. Nous explorons deux approches complémentaires : la reconstruction avec et sans régularisation. Dans les deux cas, notre travail se concentre sur la relaxation de l’hypothèse de Lipschitz-continuité généralement requise par les algorithmes de descente du premier ordre, et qui n’est pas valide pour la reconstruction de phase lorsqu’il formulée comme un problème de minimisation. L’idée clé ici
APA, Harvard, Vancouver, ISO, and other styles
38

Young, Barrington R. St A. "Efficient Algorithms for Data Mining with Federated Databases." University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179332091.

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

Chaouachi, Nadia. "Calcul rapide sur les matrices structurées : les matrices de Hankel." Besançon, 2008. http://www.theses.fr/2008BESA2073.

Full text
Abstract:
Cette thèse présente une contribution à l’amélioration de certains résultats concernant les algorithmes en Algèbre linéaire et plus particulièrement les algorithmes sur les matrices structurées. Nous présentons un nouvel algorithme de diagonalisation par blocs des matrices de Hankel, particulièrement efficace. Dans le cas où la matrice de Hankel correspond à une suite récurrente linéaire, nous retrouvons ainsi l'algorithme de Berlekamp-Massey, mais dans une version simplifiée (plus facile à expliquer et à programmer) et accélérée par des troncatures. En outre notre version permet une gestion d
APA, Harvard, Vancouver, ISO, and other styles
40

Wang, Hongjian. "Cellular matrix for parallel k-means and local search to Euclidean grid matching." Thesis, Belfort-Montbéliard, 2015. http://www.theses.fr/2015BELF0280/document.

Full text
Abstract:
Dans cette thèse, nous proposons un modèle de calcul parallèle, appelé « matrice cellulaire », pour apporter des réponses aux problématiques de calcul parallèle appliqué à la résolution de problèmes d’appariement de graphes euclidiens. Ces problèmes d’optimisation NP-difficiles font intervenir des données réparties dans le plan et des structures élastiques représentées par des graphes qui doivent s’apparier aux données. Ils recouvrent des problèmes connus sous des appellations diverses telles que geometric k-means, elastic net, topographic mapping, elastic image matching. Ils permettent de mod
APA, Harvard, Vancouver, ISO, and other styles
41

Vialard, Anne. "Chemins euclidiens : un modèle de représentation des contours discrets." Bordeaux 1, 1996. http://www.theses.fr/1996BOR10651.

Full text
Abstract:
Nous presentons dans ce travail un nouveau modele de representation des chemins discrets: les chemins euclidiens. L'idee de ce modele est d'associer a chaque point d'un chemin discret un point du plan euclidien situe dans le voisinage du point discret correspondant. Nous proposons une technique de construction d'un chemin euclidien qui fournit une representation lissee du chemin discret initial. Cette construction s'appuie sur la recherche d'une tangente discrete en chaque point du chemin discret considere. Nous avons etudie plusieurs applications des chemins euclidiens diriges par la tangente
APA, Harvard, Vancouver, ISO, and other styles
42

Martins, Charles James Leite [UNESP]. "Algoritmo da divisão de Euclides : uma nova proposta de ensino de matemática na educação básica." Universidade Estadual Paulista (UNESP), 2015. http://hdl.handle.net/11449/138399.

Full text
Abstract:
Made available in DSpace on 2016-05-17T16:51:07Z (GMT). No. of bitstreams: 0 Previous issue date: 2015-04-09. Added 1 bitstream(s) on 2016-05-17T16:54:38Z : No. of bitstreams: 1 000863310.pdf: 458943 bytes, checksum: 8a83b4d07ce20b3a1728ee48a635d0bc (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>O presente trabalho tem o objetivo de propor ao professor de Matemática uma nova maneira de abordar alguns conteúdos na Educação Básica e tratá-los como consequência do Algoritmo da Divisão de Euclides, bem como propormos uma reflexão sobre a postura de sua docência e
APA, Harvard, Vancouver, ISO, and other styles
43

Martins, Charles James Leite. "Algoritmo da divisão de Euclides : uma nova proposta de ensino de matemática na educação básica /." São José do Rio Preto, 2015. http://hdl.handle.net/11449/138399.

Full text
Abstract:
Orientador: Edson Donizete de Carvalho<br>Banca: Inocêncio Fernandes Balieiro Filho<br>Banca: Elen Viviani Pereira Spreafíaco<br>Resumo: O presente trabalho tem o objetivo de propor ao professor de Matemática uma nova maneira de abordar alguns conteúdos na Educação Básica e tratá-los como consequência do Algoritmo da Divisão de Euclides, bem como propormos uma reflexão sobre a postura de sua docência em relação a esse tópico e também em relação a bagagem matemática para o exercício da docência. Por fim, propomos alguns conteúdos estudados em qualquer curso de Aritmética, alguns resultados impo
APA, Harvard, Vancouver, ISO, and other styles
44

Tydrichová, Magdaléna. "Structural and algorithmic aspects of preference domain restrictions in collective decision making : contributions to the study of single-peaked and Euclidean preferences." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS048.

Full text
Abstract:
Cette thèse étudie des aspects structurels et algorithmiques des restrictions de domaines de préférences, en se focalisant sur les préférences unimodales et les préférences Euclidiennes. Dans la première partie de la thèse, nous introduisons d'abord une généralisation des préférences unimodales sur des graphes quelconques, en se focalisant sur des aspects algorithmiques, notamment le problème de reconnaissance. Dans un deuxième temps, nous nous intéressons aux préférences presque unimodales. Plus précisément, nous proposons une nouvelle métrique d'unimodalité approchée et nous étudions ses pro
APA, Harvard, Vancouver, ISO, and other styles
45

Hulin, Jérôme. "Axe médiant discret : propriétés arithmétiques et algorithmes." Aix-Marseille 2, 2009. http://theses.univ-amu.fr.lama.univ-amu.fr/2009AIX22086.pdf.

Full text
Abstract:
L’axe médian est un outil géométrique largement utilisé dans de nombreux domaines de l’analyse d’image. En géométrie discrète, l’axe médian d’une forme est l’ensemble des centres des boules maximales dans la forme. Ses propriétées ainsi que son calcul sont étroitement liés à la famille de distance utilisée pour définir les boules. Dans ce mémoire, nous proposons plusieurs contributions, théoriques et algorithmiques, pour les distances les plus utilisées dans le domaine, à savoir la distance euclidienne et les normes de chanfrein : nous donnons une caractérisation des normes de chanfrein ; nous
APA, Harvard, Vancouver, ISO, and other styles
46

Edson, Marcia Ruth. "Around the Fibonacci Numeration System." Thesis, University of North Texas, 2007. https://digital.library.unt.edu/ark:/67531/metadc3676/.

Full text
Abstract:
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can be written as a sum of distinct Fibonacci numbers, we exhibit certain regularity properties of R(n), one of which is connected to the Euler φ-function. In addition, using a theorem of Fine and Wilf, we give a formula for R(n) in terms of binomial coefficients modulo two.
APA, Harvard, Vancouver, ISO, and other styles
47

Coelho, Jhones Carvalho. "O estudo das árvores de Steiner no Plano Euclidiano e algumas aplicações através do Algoritmo de Melzak." Universidade Federal do Amazonas, 2016. http://tede.ufam.edu.br/handle/tede/5923.

Full text
Abstract:
Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-13T14:54:34Z No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-13T14:55:02Z (GMT) No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b20
APA, Harvard, Vancouver, ISO, and other styles
48

Ibrahim, Amin Abdurahman. "Detecting and preventing the electronic transmission of illicit images." Thesis, UOIT, 2009. http://hdl.handle.net/10155/23.

Full text
Abstract:
The sexual exploitation of children remains a very serious problem and is rapidly increasing globally through the use of the Internet. This work focuses on the current methods employed by criminals to generate and distribute child pornography, the methods used by law enforcement agencies to deter them, and the drawbacks of currently used methods, as well as the surrounding legal and privacy issues. A proven method to detect the transmission of illicit images at the network layer is presented within this paper. With this research, it is now possible to actively filter illicit pornographic image
APA, Harvard, Vancouver, ISO, and other styles
49

Kharchenko, Natalia. "Lattice algorithms and lattice-based cryptography." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.

Full text
Abstract:
La cryptographie basée sur les réseaux est un domaine de recherche qui étudie la construction d'outils pour une communication sécurisée basée sur des problèmes de réseaux difficiles. La cryptographie basée sur les réseau est l'un des candidats les plus prometteurs pour la communication sécurisée post-quantique. Cette thèse étudie les algorithmes pour résoudre les problèmes de réseaux difficiles et leur application à l'évaluation de la sécurité des constructions cryptographiques. Dans la première partie, nous introduisons une nouvelle famille d'algorithmes de sieving appelé sieving cylindrique.
APA, Harvard, Vancouver, ISO, and other styles
50

Crisci, Rosamaria. "Etude des conditions de viabilité d'une approche basée sur l'algorithmique et la programmation pour l'apprentissage de la division euclidienne à l'école primaire." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALM046.

Full text
Abstract:
L’objectif de notre thèse est de contribuer à l’étude des conditions de viabilité d’une approche basée sur l’algorithmique et la programmation pour l’enseignement et l’apprentissage de notions mathématiques à l’école primaire. Pour cela, nous considérons une séquence d’enseignement portant sur le sens de la division euclidienne, conçue par les chercheurs du projet EXPIRE dans l’environnement de programmation Scratch. Trois axes de recherche sont explorés : 1) la modélisation didactique des savoirs impliqués dans la séquence ; 2) l’étude de la viabilité de la séquence au sein du curriculum de l
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Euclidean algorithm' for other source types:
Journal articles Books
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!

To the bibliography