Log in

Relevant bibliographies by topics / Computing geometry / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Computing geometry.

Dissertations / Theses on the topic 'Computing geometry'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 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 'Computing geometry.'

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

Pennec, Xavier. "Statistical Computing on Manifolds for Computational Anatomy." Habilitation à diriger des recherches, Université de Nice Sophia-Antipolis, 2006. http://tel.archives-ouvertes.fr/tel-00633163.

Full text

Abstract:

During the last decade, my main research topic was on medical image analysis, and more particularly on image registration. However, I was also following in background a more theoretical research track on statistical computing on manifolds. With the recent emergence of computational anatomy, this topic gained a lot of importance in the medical image analysis community. During the writing of this habilitation manuscript, I felt that it was time to present a more simple and uni ed view of how it works and why it can be important. This is why the usual short synthesis of the habilitation became a

APA, Harvard, Vancouver, ISO, and other styles

2

Rappaport, David 1955. "The complexity of computing simple circuits in the plane /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75339.

Full text

Abstract:

As far back as Euclid's ruler and compass constructions, computation and geometry have been domains for the exploration and development of fundamental mathematical concepts and ideas. The invention of computers has spurred new research in computation, and now with a variety of applications couched in the fundamentals of Euclidean geometry, the study of geometric algorithms has again become a popular mathematical pursuit.<br>In this thesis, the computational aspects of a fundamental problem in Euclidean geometry is examined. Given a set of line segments in the Euclidean plane, one is asked to c

APA, Harvard, Vancouver, ISO, and other styles

3

Griffith, Kenfield A. (Kenfield Allistair). "Design computing of complex-curved geometry using digital fabrication methods." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34986.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Architecture, 2006.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (leaves 64-65).<br>The production of design information for digital fabrication is presented in this thesis. This thesis outlines the research of generating information for physical construction as architectural models of complex curved walls built from unique units. A series of computer programs and physical models as example

APA, Harvard, Vancouver, ISO, and other styles

4

Harrison, Anthony Westbrook. "Algorithms for Computing the Lattice Size." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1529781033957183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Osanlou, Ardeshir. "Soft computing and fractal geometry in signal processing and pattern recognition." Thesis, De Montfort University, 2000. http://hdl.handle.net/2086/4242.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Kuiyu. "Computing Homological Features for Shapes." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1282072779.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wills, Michael Thomas. "Computing the trace of an endomorphism of a supersingular elliptic curve." Thesis, Virginia Tech, 2021. http://hdl.handle.net/10919/103821.

Full text

Abstract:

We provide an explicit algorithm for computing the trace of an endomorphism of an elliptic curve which is given by a chain of small-degree isogenies. We analyze its complexity, determining that if the length of the chain, the degree of the isogenies, and the log of the field-size are all O(n), the trace of the endomorphism can be computed in O(n⁶) bit operations. This makes explicit a theorem of Kohel which states that such a polynomial time algorithm exists. The given procedure is based on Schoof's point-counting algorithm.<br>Master of Science<br>The developing technology of quantum computer

APA, Harvard, Vancouver, ISO, and other styles

8

wang, zhiqiang. "STUDYING COMPUTATIONAL METHODS FOR BIOMEDICAL GEOMETRY EXTRACTION AND PATIENT SPECIFIC HEMODYNAMICS." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1493042299659479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hadzihasanovic, Amar. "The algebra of entanglement and the geometry of composition." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:711fc159-cd6a-42c3-a4b6-7ed7f594f781.

Full text

Abstract:

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of higher algebraic theories, and as combinatorial descriptions of "directed spaces". Operations of polygraphs modelled on operations of topological spaces are used as the foundation of a compositional universal algebra, where sliding moves arise from tensor products of polygraphs. We reconstruct several higher algebraic theories in this framework. In this regard, t

APA, Harvard, Vancouver, ISO, and other styles

10

Schulz, Henrik. "Polyhedral Surface Approximation of Non-Convex Voxel Sets and Improvements to the Convex Hull Computing Method." Forschungszentrum Dresden, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:d120-qucosa-27865.

Full text

Abstract:

In this paper we introduce an algorithm for the creation of polyhedral approximations for objects represented as strongly connected sets of voxels in three-dimensional binary images. The algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of

APA, Harvard, Vancouver, ISO, and other styles

11

Schulz, Henrik. "Polyhedral Surface Approximation of Non-Convex Voxel Sets and Improvements to the Convex Hull Computing Method." Forschungszentrum Dresden-Rossendorf, 2009. https://hzdr.qucosa.de/id/qucosa%3A21613.

Full text

Abstract:

In this paper we introduce an algorithm for the creation of polyhedral approximations for objects represented as strongly connected sets of voxels in three-dimensional binary images. The algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of

APA, Harvard, Vancouver, ISO, and other styles

12

McCulloch, Thomas L. "Feasible Form Parameter Design of Complex Ship Hull Form Geometry." ScholarWorks@UNO, 2018. https://scholarworks.uno.edu/td/2552.

Full text

Abstract:

This thesis introduces a new methodology for robust form parameter design of complex hull form geometry via constraint programming, automatic differentiation, interval arithmetic, and truncated hierarchical B- splines. To date, there has been no clearly stated methodology for assuring consistency of general (equality and inequality) constraints across an entire geometric form parameter ship hull design space. In contrast, the method to be given here can be used to produce guaranteed narrowing of the design space, such that infeasible portions are eliminated. Furthermore, we can guarantee that

APA, Harvard, Vancouver, ISO, and other styles

13

Sanguinet, William Charles. "Various extensions in the theory of dynamic materials with a specific focus on the checkerboard geometry." Digital WPI, 2017. https://digitalcommons.wpi.edu/etd-dissertations/243.

Full text

Abstract:

This work is a numerical and analytical study of wave motion through dynamic materials (DM). This work focuses on showing several results that greatly extend the applicability of the checkerboard focusing effect. First, it is shown that it is possible to simultaneously focus dilatation and shear waves propagating through a linear elastic checkerboard structure. Next, it is shown that the focusing effect found for the original €œperfect€� checkerboard extends to the case of the checkerboard with smooth transitions between materials, this is termed a functionally graded (FG) checkerboard. With t

APA, Harvard, Vancouver, ISO, and other styles

14

Woxler, Platon. "Efficient generation and rendering of tube geometry in Unreal Engine : Utilizing compute shaders for 3D line generation." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-302564.

Full text

Abstract:

Massive graph visualization in an immersive environment, such as virtual reality (VR) or Augmented Reality (AR), has the possibility to improve users’ understanding when exploring data in new ways. To make the most of a visualization, such as this, requires interactive components that are fast enough to accommodate interactivity. By rendering the edges of the graph as shaded lines that imitate three‑dimensional (3D) lines or tubes, one can circumvent technical limitations. This method works well enough when using traditional two‑dimensional (2D) monitors, but representing tubes as flat lines i

APA, Harvard, Vancouver, ISO, and other styles

15

Conti, José Carlos 1966. "Eficácia de medidas de similaridade para a classificação de séries temporais associadas ao comportamento fenológico de plantas." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267746.

Full text

Abstract:

Orientadores: Luiz Camolesi Júnior, Ricardo da Silva Torres<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia<br>Made available in DSpace on 2018-08-24T02:27:51Z (GMT). No. of bitstreams: 1 Conti_JoseCarlos_M.pdf: 2108170 bytes, checksum: 16e7093192986c856bf2d3675ef2a605 (MD5) Previous issue date: 2013<br>Resumo: Fenologia é o estudo de fenômenos naturais periódicos e sua relação com o clima. Nos últimos anos, tem se apresentado relevante como o indicador mais simples e confiável dos efeitos das mudanças climáticas em plantas e animais. É nesse contexto q

APA, Harvard, Vancouver, ISO, and other styles

16

Poole, Christopher Mark. "Faster Monte Carlo simulation of radiotherapy geometries." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/59972/1/Christopher_Poole_Thesis.pdf.

Full text

Abstract:

Using Monte Carlo simulation for radiotherapy dose calculation can provide more accurate results when compared to the analytical methods usually found in modern treatment planning systems, especially in regions with a high degree of inhomogeneity. These more accurate results acquired using Monte Carlo simulation however, often require orders of magnitude more calculation time so as to attain high precision, thereby reducing its utility within the clinical environment. This work aims to improve the utility of Monte Carlo simulation within the clinical environment by developing techniques whi

APA, Harvard, Vancouver, ISO, and other styles

17

Neto, Leoncio Claro de Barros. "Modelagem em geometria digital aprimorada por técnicas adaptativas de segmentos de retas." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-11082011-135522/.

Full text

Abstract:

Visando representar linhas retas digitais, segmentos digitalizados e arcos, cada uma das linhas de pesquisa disponíveis apresenta suas vantagens e aplicações apropriadas. No entanto, considerando as complexidades de cenários do mundo real, o uso dessas representações não é tão popular em situações que requerem modelos flexíveis ou envolvendo interferências espúrias. As tecnologias adaptativas são formalismos da ciência da computação capazes de alterar seu comportamento dinamicamente, sem a interferência de agentes externos, em resposta a estímulos de entrada. Ao serem capazes de responder às m

APA, Harvard, Vancouver, ISO, and other styles

18

Aloupis, Greg. "On computing geometric estimators of location." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31181.

Full text

Abstract:

Let S be a data set of n points in Rd, and m&d4; be a point in Rd which "best" describes S. Since the term "best" is subjective, there exist several definitions for finding m&d4; . However, it is generally agreed that such a definition, or estimator of location, should have certain statistical properties which make it robust. Most estimators of location assign a depth value to any point in Rd and define m&d4; to be a point with maximum depth. Here, new results are presented concerning the computational complexity of estimators of location. We prove that in R2 the computation of simplicial and

APA, Harvard, Vancouver, ISO, and other styles

19

Obiala, Renata. "Geometric decomposition tools for parallel computing." Thesis, Heriot-Watt University, 2007. http://hdl.handle.net/10399/2042.

Full text

Abstract:

This thesis describes new geometric decomposition tools for parallel computing. A new complete process of model preparation for parallel analysis is proposed 'and investigated. The process focuses on applying geometrical entities rather than mesh elements to the decomposition problem. The study starts with an exploration of different geometrical representations in order to select the most suitable representation-f6i:- the purpose of this research. Next, the model is orthogollalised and cut into blocks to create a decomposed orthogonal model. The blocks composing the model are allocated to a gi

APA, Harvard, Vancouver, ISO, and other styles

20

Mantzaflaris, Angelos. "Robust algebraic methods for geometric computing." Nice, 2011. http://www.theses.fr/2011NICE4030.

Full text

Abstract:

Le calcul géométrique en modélisation et en CAO nécessite la résolution approchée, et néanmoins certifiée, de systèmes polynomiaux. Nous introduisons de nouveaux algorithmes de sous-division afin de résoudre ce problème fondamental, calculant des développements en fractions continues des coordonnées des solutions. Au-delà des exemples concrets, nous fournissons des estimations de la complexité en bits et des bornes dans le modèle de RAM réelle. La difficulté principale de toute méthode de résolution consiste en les points singuliers isolés. Nous utilisons les systèmes locaux inverses et des ca

APA, Harvard, Vancouver, ISO, and other styles

21

Vigneron, Pierre Antoine Emile. "Algorithms for computing some geometric diagrams /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20VIGNER.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002.<br>Includes bibliographical references (leaves 100-105). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

22

Liu, Junbin. "Distributed low-power image processing in wireless sensor networks for intelligent video surveillance applications." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/63311/1/Junbin_Liu_Thesis.pdf.

Full text

Abstract:

Distributed Wireless Smart Camera (DWSC) network is a special type of Wireless Sensor Network (WSN) that processes captured images in a distributed manner. While image processing on DWSCs sees a great potential for growth, with its applications possessing a vast practical application domain such as security surveillance and health care, it suffers from tremendous constraints. In addition to the limitations of conventional WSNs, image processing on DWSCs requires more computational power, bandwidth and energy that presents significant challenges for large scale deployments. This dissertation ha

APA, Harvard, Vancouver, ISO, and other styles

23

Rodrigues, Sergio Boiteux de Figueiredo. "Utilização de modelos virtuais tridimensionais na interação com a informação georreferenciada." Universidade do Estado do Rio de Janeiro, 2014. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=7728.

Full text

Abstract:

Esta pesquisa tem como finalidade explorar os recursos de interação do usuário com a informação georreferenciada, utilizando o próprio ambiente físico e seus elementos como interface. A indexação geográfica de arquivos digitais e os recursos disponíveis pela computação móvel estabeleceram um novo modelo de interação com a informação. Cabe ao designer criar sistemas e interfaces que levem em consideração a localização do usuário no acesso da informação atribuída ao entorno. Foi identificado que as soluções desenvolvidas para esse propósito utilizam telas e outros aparatos tecnológicos que const

APA, Harvard, Vancouver, ISO, and other styles

24

Hildenbrand, Dietmar. "Geometric computing in computer graphics and robotics using conformal geometric algebra." Phd thesis, [S.l.] : [s.n.], 2007. http://elib.tu-darmstadt.de/diss/000764.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Whitinger, Robert. "An Algorithm for the Machine Calculation of Minimal Paths." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etd/3119.

Full text

Abstract:

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R3, but also to the general case of finding minimal functionals on hypersurfaces in Rn associated with an arbitrary metric.

APA, Harvard, Vancouver, ISO, and other styles

26

Rassart, Étienne 1975. "Geometric approaches to computing Kostka numbers and Littlewood-Richardson coefficients." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/16632.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2004.<br>Includes bibliographical references (p. 119-125).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Using tools from combinatorics, convex geometry and symplectic geometry, we study the behavior of the Kostka numbers and Littlewood-Richardson coefficients (the type A weight multiplicities and Clebsch-Gordan coefficients). We sh w that both are given by piecewise polynomial functions in the entries of the pa

APA, Harvard, Vancouver, ISO, and other styles

27

Fonn, Eivind. "Computing Metrics on Riemannian Shape Manifolds : Geometric shape analysis made practical." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9868.

Full text

Abstract:

<p>Shape analysis and recognition is a field ripe with creative solutions and innovative algorithms. We give a quick introduction to several different approaches, before basing our work on a representation introduced by Klassen et. al., considering shapes as equivalence classes of closed curves in the plane under reparametrization, and invariant under translation, rotation and scaling. We extend this to a definition for nonclosed curves, and prove a number of results, mostly concerning under which conditions on these curves the set of shapes become manifolds. We then motivate the study of geod

APA, Harvard, Vancouver, ISO, and other styles

28

KAIMAL, VINOD GOPALKRISHNA. "A NEURAL METHOD OF COMPUTING OPTICAL FLOW BASED ON GEOMETRIC CONSTRAINTS." University of Cincinnati / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1037632137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Hussain, Mahmood Irtiza. "Geometric phase gates and development of dedicated laser sources for quantum computing." Thesis, Griffith University, 2017. http://hdl.handle.net/10072/369056.

Full text

Abstract:

A well isolated environment can be ideal for a quantum system to perform e ciently. Unlike this a PhD student needs to interact with many people during the course to complete a research project timely. Having said that, here is a list of people whom I would like to pay my deepest and profound gratitude. I would like to thank my rst principal supervisor Prof. David Kielpinski, who accepted me to work in his research group and guided me like a professional physicist. Later on, sudden news about his permanent departure to USA at the stage when I was really close to nish a project was quite chal

APA, Harvard, Vancouver, ISO, and other styles

30

Busaryev, Oleksiy. "On Computing and Tracking Geometrical and Topological Features." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354679582.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Skone, Gwyn S. "Stratagems for effective function evaluation in computational chemistry." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8843465b-3e5f-45d9-a973-3b27949407ef.

Full text

Abstract:

In recent years, the potential benefits of high-throughput virtual screening to the drug discovery community have been recognized, bringing an increase in the number of tools developed for this purpose. These programs have to process large quantities of data, searching for an optimal solution in a vast combinatorial range. This is particularly the case for protein-ligand docking, since proteins are sophisticated structures with complicated interactions for which either molecule might reshape itself. Even the very limited flexibility model to be considered here, using ligand conformation ensemb

APA, Harvard, Vancouver, ISO, and other styles

32

Kult, David. "Quantum Holonomies : Concepts and Applications to Quantum Computing and Interferometry." Doctoral thesis, Uppsala University, Quantum Chemistry, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8185.

Full text

Abstract:

<p>Quantum holonomies are investigated in different contexts.</p><p>A geometric phase is proposed for decomposition dependent evolution, where each component of a given decomposition of a mixed state evolves independently. It is shown that this geometric phase only depends on the path traversed in the space of decompositions.</p><p>A holonomy is associated to general paths of subspaces of a Hilbert space, both discrete and continuous. This opens up the possibility of constructing quantum holonomic gates in the open path setting. In the discrete case it is shown that it is possible to associate

APA, Harvard, Vancouver, ISO, and other styles

33

Bakewell, Katie. "Self-Assembly of DNA Graphs and Postman Tours." UNF Digital Commons, 2018. https://digitalcommons.unf.edu/etd/857.

Full text

Abstract:

DNA graph structures can self-assemble from branched junction molecules to yield solutions to computational problems. Self-assembly of graphs have previously been shown to give polynomial time solutions to hard computational problems such as 3-SAT and k-colorability problems. Jonoska et al. have proposed studying self-assembly of graphs topologically, considering the boundary components of their thickened graphs, which allows for reading the solutions to computational problems through reporter strands. We discuss weighting algorithms and consider applications of self-assembly of graphs and the

APA, Harvard, Vancouver, ISO, and other styles

34

Kniazev, Roman. "On geometric models of epistemic logic." Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAX132.

Full text

Abstract:

Il y a environ 30 ans, deux approches majeures pour l'étude des systèmes distribués ont été développées. Une des approches a établi une perspective topologique sur le calcul distribué,exprimant la solvabilité des tâches distribuées à travers des notions standards de topologie algébrique, en modélisant les espaces d'états sous forme de complexes simpliciaux. En parallèle, une application importante de la logique épistémique, un type de logique modale, a apporté un point de vue alternatif sur la structure des systèmes distribués, en utilisant la notion de connaissance pour décrire le comportemen

APA, Harvard, Vancouver, ISO, and other styles

35

Moin, Afshin. "Les Techniques De Recommandation Et De Visualisation Pour Les Données A Une Grande Echelle." Phd thesis, Université Rennes 1, 2012. http://tel.archives-ouvertes.fr/tel-00724121.

Full text

Abstract:

Nous avons assisté au développement rapide de la technologie de l'information au cours de la dernière décennie. D'une part, la capacité du traitement et du stockage des appareils numériques est en constante augmentation grâce aux progrès des méthodes de construction. D'autre part, l'interaction entre ces dispositifs puissants a été rendue possible grâce à la technologie de réseautage. Une conséquence naturelle de ces progrès, est que le volume des données générées dans différentes applications a grandi à un rythme sans précédent. Désormais, nous sommes confrontés à de nouveaux défis pour trait

APA, Harvard, Vancouver, ISO, and other styles

36

Boufama, Boubakeur. "Reconstruction tridimensionnelle en vision par ordinateur : cas des caméras non étalonnées." Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00005080.

Full text

Abstract:

"la 4e de couverture indique : Cette thèse concerne principalement la reconstruction tridimensionnelle à partir d'images issues de caméras non étalonnées. Deux autres sujets liés à la reconstruction ont été traités: le calcul de la géométrie épipolaire et la mise en correspondance des points dans les images<br>Nous nous plaçons dans le cas général d'une séquence d'images obtenues avec une ou plusieurs caméras inconnues. Quand seuls les points observés dans les images sont utilisés la seule reconstruction possible est de type projective. Nous proposons d'abord une méthode pour calculer la recon

APA, Harvard, Vancouver, ISO, and other styles

37

Nguyen, Van Minh. "Wireless Link Quality Modelling and Mobility Management for Cellular Networks." Phd thesis, Telecom ParisTech, 2011. http://tel.archives-ouvertes.fr/tel-00702798.

Full text

Abstract:

La qualité de communication dans un réseau sans fil est déterminée par la qualité du signal, et plus précisément par le rapport signal à interférence et bruit. Cela pousse chaque récepteur à se connecter à l'émetteur qui lui donne la meilleure qualité du signal. Nous utilisons la géométrie stochastique et la théorie des extrêmes pour obtenir la distribution de la meilleure qualité du signal, ainsi que celles de interférence et du maximum des puissances reçues. Nous mettons en évidence comment la singularité de la fonction d'affaiblissement modifie leurs comportements. Nous nous intéressons ens

APA, Harvard, Vancouver, ISO, and other styles

38

Orti, Rachel. "Radiosité dynamique 2D et complexe de visibilité." Phd thesis, Université Joseph Fourier (Grenoble), 1997. http://tel.archives-ouvertes.fr/tel-00004958.

Full text

Abstract:

La méthode de radiosité, méthode de simulation globale de l'éclairage, est très utilisée pour la visualisation de scènes d'intérieur statiques. Malgré les différentes améliorations apportées jusqu'à présent, son coût reste conditionné par le calcul des facteurs de forme qui modélisent l'interaction lumineuse entre deux surfaces. Ce calcul constitue l'étape la plus coûteuse de la méthode de radiosité, compte tenu des calculs de visibilité qu'il implique. D'autre part, il semble primordial d'utiliser un maillage qui suive les discontinuités (c'est à dire les limites d'ombre et de pénombre), pour

APA, Harvard, Vancouver, ISO, and other styles

39

Alves, Rafael Santos de Oliveira 1982. "Algebra geometrica e o algoritmo de Grover." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306805.

Full text

Abstract:

Orientador: Carlile Campos Lavor<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-08-11T07:27:34Z (GMT). No. of bitstreams: 1 Alves_RafaelSantosdeOliveira_M.pdf: 2108746 bytes, checksum: 26f9217f1127ef34f9a7ae1692c995b8 (MD5) Previous issue date: 2008<br>Resumo: O Algoritmo de Grover é um algoritmo quântico de busca em um conjunto desordenado. Com o uso de propriedades da mecânica quântica, ele apresenta um ganho quadrático em relação a um algoritmo clássico. Neste trabalho, apresen

APA, Harvard, Vancouver, ISO, and other styles

40

Lambert, Antoine. "Visualisation interactive de graphes : élaboration et optimisation d'algorithmes à coûts computationnels élevés." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2012. http://tel.archives-ouvertes.fr/tel-00839243.

Full text

Abstract:

Un graphe est un objet mathématique modélisant des relations sur un ensemble d' éléments. Il est utilisé dans de nombreux domaines a des fi ns de modélisation. La taille et la complexité des graphes manipulés de nos jours entraînent des besoins de visualisation a fin de mieux les analyser. Dans cette thèse, nous présentons différents travaux en visualisation interactive de graphes qui s'attachent a exploiter les architectures de calcul parallèle (CPU et GPU) disponibles sur les stations de travail contemporaines. Un premier ensemble de travaux s'intéresse a des problématiques de dessin de grap

APA, Harvard, Vancouver, ISO, and other styles

41

Ferreira, Roberto de Carvalho. "Ferramenta computacional para a definição e geração de estruturas cristalinas." Universidade Federal de Juiz de Fora, 2012. https://repositorio.ufjf.br/jspui/handle/ufjf/1796.

Full text

Abstract:

Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-06-10T11:28:09Z No. of bitstreams: 1 robertodecarvalhoferreira.pdf: 4632819 bytes, checksum: e5bd9a607a629a54c4f57e8d4c95a5ed (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-07-13T13:47:43Z (GMT) No. of bitstreams: 1 robertodecarvalhoferreira.pdf: 4632819 bytes, checksum: e5bd9a607a629a54c4f57e8d4c95a5ed (MD5)<br>Made available in DSpace on 2016-07-13T13:47:43Z (GMT). No. of bitstreams: 1 robertodecarvalhoferreira.pdf: 4632819 bytes, checksum: e5bd9a607a629a54c4f57e8d4c95a5ed (MD5)

APA, Harvard, Vancouver, ISO, and other styles

42

Dong, Wenzheng. "Quantum Information Processing with Color Center Qubits: Theory of Initialization and Robust Control." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/103438.

Full text

Abstract:

Quantum information technologies include secure quantum communications and ultra precise quantum sensing that are significantly more efficient than their classical counterparts. To enable such technologies, we need a scalable quantum platform in which qubits are con trollable. Color centers provide controllable optically-active spin qubits within the coherence time limit. Moreover, the nearby nuclear spins have long coherence times suitable for quantum memories. In this thesis, I present a theoretical understanding of and control protocols for various color centers. Using group theory, I explo

APA, Harvard, Vancouver, ISO, and other styles

43

Verdie, Yannick. "Modélisation de scènes urbaines à partir de données aeriennes." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00881242.

Full text

Abstract:

L'analyse et la reconstruction automatique de scène urbaine 3D est un problème fondamental dans le domaine de la vision par ordinateur et du traitement numérique de la géométrie. Cette thèse présente des méthodologies pour résoudre le problème complexe de la reconstruction d'éléments urbains en 3D à partir de données aériennes Lidar ou bien de maillages générés par imagerie Multi-View Stereo (MVS). Nos approches génèrent une représentation précise et compacte sous la forme d'un maillage 3D comportant une sémantique de l'espace urbain. Deux étapes sont nécessaires; une identification des différ

APA, Harvard, Vancouver, ISO, and other styles

44

Casero, Cañas Ramón. "Left ventricle functional analysis in 2D+t contrast echocardiography within an atlas-based deformable template model framework." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:b17b3670-551d-4549-8f10-d977295c1857.

Full text

Abstract:

This biomedical engineering thesis explores the opportunities and challenges of 2D+t contrast echocardiography for left ventricle functional analysis, both clinically and within a computer vision atlas-based deformable template model framework. A database was created for the experiments in this thesis, with 21 studies of contrast Dobutamine Stress Echo, in all 4 principal planes. The database includes clinical variables, human expert hand-traced myocardial contours and visual scoring. First the problem is studied from a clinical perspective. Quantification of endocardial global and local funct

APA, Harvard, Vancouver, ISO, and other styles

45

Mencel, Liam A. "A Faster Algorithm for Computing Straight Skeletons." Thesis, 2014. http://hdl.handle.net/10754/316713.

Full text

Abstract:

We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n (log n) log r) time. It improves on the previously best known algorithm for this reduction, which is randomised, and runs in expected O(n √(h+1) log² n) time for a polygon with h holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we can compute the s

APA, Harvard, Vancouver, ISO, and other styles

46

Lieber, Joshua Franklin. "Études in Homotopical Thinking: F₁-geometry, Concurrent Computing, and Motivic Measures." Thesis, 2021. https://thesis.library.caltech.edu/14269/1/Lieber_Joshua_2021.pdf.

Full text

Abstract:

This thesis weaves together three papers, each of which provides a use of homotopical intuition in a different field of mathematics. The first applies it to the study of various models of F₁-geometry, focusing mainly on the Bost-Connes algebra. The second endeavors to compare two homotopical models for concurrent computing before introducing a new one as well. Finally, the last paper provides a construction for obtaining derived motivic measures from an abstract six functors formalism and, in particular, applies this idea to obtain a lift of the Gillet-Soulé motivic measure.

APA, Harvard, Vancouver, ISO, and other styles

47

Belloni, Alexandre, and Robert M. Freund. "An Algorithm for Computing the Symmetry Point of a Polytope." 2003. http://hdl.handle.net/1721.1/3876.

Full text

Abstract:

Given a closed convex set C and a point x in C, let sym(x,C) denote the symmetry value of x in C, which essentially measures how symmetric C is about the point x. Denote by sym(C) the largest value of sym(x,C) among all x in C, and let x* denote the most symmetric point in C. These symmetry measures are all invariant under linear transformation, change in inner product, etc., and so are of interest in the study of the geometry of convex sets and arise naturally in the evaluation of the complexity of interior-point methods in particular. Herein we show that when C is given by the intersection o

APA, Harvard, Vancouver, ISO, and other styles

48

Ziotopoulos, Agisilaos Georgios. "Design of platforms for computing context with spatio-temporal locality." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-05-3328.

Full text

Abstract:

This dissertation is in the area of pervasive computing. It focuses on designing platforms for storing, querying, and computing contextual information. More specifically, we are interested in platforms for storing and querying spatio-temporal events where queries exhibit locality. Recent advances in sensor technologies have made possible gathering a variety of information on the status of users, the environment machines, etc. Combining this information with computation we are able to extract context, i.e., a filtered high-level description of the situation. In many cases, the information gath

APA, Harvard, Vancouver, ISO, and other styles

49

Zhang, Yongqiang. "Computation Offloading and Service Caching in Heterogeneous MEC Wireless Networks." Thesis, 2021. http://hdl.handle.net/10754/668910.

Full text

Abstract:

Mobile edge computing (MEC) can dramatically promote the compu- tation capability and prolong the lifetime of mobile users by offloading computation- intensive tasks to edge cloud. In this thesis, a spatial-random two-tier heterogeneous network (HetNet) is modelled to feature random node distribution, where the small- cell base stations (SBSs) and the macro base stations (MBSs) are cascaded with resource-limited servers and resource-unlimited servers, respectively. Only a certain type of application services and finite number of offloaded tasks can be cached and processed in the resource-limit

APA, Harvard, Vancouver, ISO, and other styles

50

Murça, Miguel Eduardo de Vasconcelos Morais. "Molecular Geometry Calculations Using a Novel Quantum Variational Approach." Master's thesis, 2020. http://hdl.handle.net/10316/92475.

Full text

Abstract:

Dissertação de Mestrado em Física apresentada à Faculdade de Ciências e Tecnologia<br>O trabalho apresentado nesta tese surge como uma extensão de duas linhas separadas de trabalho: por um lado, advém do trabalho prévio do grupo QUANTIC, da Universidade de Barcelona, onde parte do trabalho de tese aqui apresentado foi desenvolvido, sob um estágio Erasmus. O grupo QUANTIC tem como área principal de investigação a computação quântica; dos seus trabalhos recentes constam aplicações de Algoritmos Quânticos Variacionais (Quantum Variational Algorithms, QVAs) e geralmente computação quântica a difer

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!