Log in

Relevant bibliographies by topics / Hierarchical graph / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Hierarchical graph.

Dissertations / Theses on the topic 'Hierarchical graph'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 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 'Hierarchical graph.'

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

Busatto, Giorgio. "An abstract model of hierarchical graphs and hierarchical graph transformation." Oldenburg : Univ., Fachbereich Informatik, 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=967851955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Busatto, Giorgio [Verfasser]. "An abstract model of hierarchical graphs and hierarchical graph transformation / von Giorgio Busatto." Oldenburg : Univ., Fachbereich Informatik, 2002. http://d-nb.info/967851955/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Slade, Michael L. "A layout algorithm for hierarchical graphs with constraints /." Online version of thesis, 1994. http://hdl.handle.net/1850/11724.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kakraba, Samuel. "A Hierarchical Graph for Nucleotide Binding Domain 2." Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etd/2517.

Full text

Abstract:

One of the most prevalent inherited diseases is cystic fibrosis. This disease is caused by a mutation in a membrane protein, the cystic fibrosis transmembrane conductance regulator (CFTR). CFTR is known to function as a chloride channel that regulates the viscosity of mucus that lines the ducts of a number of organs. Generally, most of the prevalent mutations of CFTR are located in one of two nucleotide binding domains, namely, the nucleotide binding domain 1 (NBD1). However, some mutations in nucleotide binding domain 2 (NBD2) can equally cause cystic fibrosis. In this work, a hierarchical gr

APA, Harvard, Vancouver, ISO, and other styles

5

Choset, Howie M. Burdick Joel Wakeman Burdick Joel Wakeman. "Sensor based motion planning : the hierarchical generalized Voronoi graph /." Diss., Pasadena, Calif. : California Institute of Technology, 1996. http://resolver.caltech.edu/CaltechETD:etd-12182007-090504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wengle, Emil. "Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula." Thesis, Uppsala universitet, Signaler och system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-415044.

Full text

Abstract:

Community detection is a topic in network theory that involves assigning labels to nodes based on some distance measure or centrality index. Detecting communities within a network can be useful to perform information condensation. In this thesis we explore how to use the approach for pedagogical purposes, and more precisely to condense and visualise the networks of facts, concepts and procedures (also called Knowledge Components (KCs)) that are offered in higher education programmes. In details, we consider one of the most common quantities used to evaluate the goodness of a community classifi

APA, Harvard, Vancouver, ISO, and other styles

7

Spisla, Christiane [Verfasser]. "Compaction of Orthogonal and Hierarchical Graph Drawings Using Constraint Graphs and Minimum Cost Flows / Christiane Spisla." München : Verlag Dr. Hut, 2019. http://d-nb.info/119641467X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Holzer, Martin. "Hierarchical speed-up techniques for shortest-path algorithms." [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10605142.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ismaeel, Alaa Aly Khalaf [Verfasser], and H. [Akademischer Betreuer] Schmeck. "Dynamic Hierarchical Graph Drawing / Alaa Aly Khalaf Ismaeel. Betreuer: H. Schmeck." Karlsruhe : KIT-Bibliothek, 2012. http://d-nb.info/1023081776/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cybis, Gabriela Bettella. "Phenotypic Bayesian phylodynamics : hierarchical graph models, antigenic clustering and latent liabilities." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/132858.

Full text

Abstract:

Combining models for phenotypic and molecular evolution can lead to powerful inference tools. Under the flexible framework of Bayesian phylogenetics, I develop statistical methods to address phylodynamic problems in this intersection. First, I present a hierarchical phylogeographic method that combines information across multiple datasets to draw inference on a common geographical spread process. Each dataset represents a parallel realization of this geographic process on a different group of taxa, and the method shares information between these realizations through a hierarchical graph struct

APA, Harvard, Vancouver, ISO, and other styles

11

Yang, Fang. "Construction and application of hierarchical matrix preconditioners." Diss., University of Iowa, 2008. https://ir.uiowa.edu/etd/196.

Full text

Abstract:

H-matrix techniques use a data-sparse tree structure to represent a dense or a sparse matrix. The leaves of the tree store matrix sub-blocks that are represented in full-matrix format or Rk-matrix (low rank matrix) format. H-matrix arithmetic is defined over the H-matrix representation, which includes operations such as addition, multiplication, inversion, and LU factorization. These H-matrix operations approximate results with almost optimal computational complexity. Based on the properties of H-matrices, the H-matrix preconditioner technique has been introduced. It uses H-matrix operations t

APA, Harvard, Vancouver, ISO, and other styles

12

Brown, Steven W. "Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2420.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Aleksakhin, Vladyslav. "Visualization of gene ontology and cluster analysis results." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248.

Full text

Abstract:

The purpose of the thesis is to develop a new visualization method for Gene Ontologiesand hierarchical clustering. These are both important tools in biology andmedicine to study high-throughput data such as transcriptomics and metabolomicsdata. Enrichment of ontology terms in the data is used to identify statistically overrepresentedontology terms, that give insight into relevant biological processes orfunctional modules. Hierarchical clustering is a standard method to analyze andvisualize data to nd relatively homogeneous clusters of experimental data points.Both methods support the analysis

APA, Harvard, Vancouver, ISO, and other styles

14

Testa, Henrique Gregianin. "Um modelo hierárquico para sistemas de tipos de arquivos implementado como um middleware." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2007. http://hdl.handle.net/10183/25504.

Full text

Abstract:

Com a finalidade de facilitar a manipulação de documentos pelos usuários e aplicações, foram desenvolvidas no decorrer do tempo diversas formas para classificar e organizar esses documentos, incluindo a criação de diferentes mecanismos pertinentes a formatos de arquivos, os chamados sistemas de tipos de arquivos. É possível perceber nesse esforço uma crescente preocupação com a correta identificação dos arquivos e com a obtenção de maiores informações sobre seu conteúdo. Afinal, com esse conhecimento as aplicações e ambientes gráficos dos sistemas operacionais podem adicionar novas funcionalid

APA, Harvard, Vancouver, ISO, and other styles

15

Fehri, Amin. "Image Characterization by Morphological Hierarchical Representations." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEM063/document.

Full text

Abstract:

Cette thèse porte sur l'extraction de descripteurs hiérarchiques et multi-échelles d'images, en vue de leur interprétation, caractérisation et segmentation. Elle se décompose en deux parties.La première partie expose des éléments théoriques et méthodologiques sur l'obtention de classifications hiérarchiques des nœuds d'un graphe valué aux arêtes. Ces méthodes sont ensuite appliquées à des graphes représentant des images pour obtenir différentes méthodes de segmentation hiérarchique d'images. De plus, nous introduisons différentes façons de combiner des segmentations hiérarchiques. Nous proposo

APA, Harvard, Vancouver, ISO, and other styles

16

Imaev, Aleksey A. "Hierarchical Modeling of Manufacturing Systems Using Max-Plus Algebra." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1257871858.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Kwok, Wing-hong, and 郭永康. "Streamlined and prioritized hierarchical relations: a technique for improving the effectiveness of theclassification-tree methodology." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B2975107X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Consoli, Sergio. "The development and application of metaheuristics for problems in graph theory : a computational study." Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/3061.

Full text

Abstract:

It is known that graph theoretic models have extensive application to real-life discrete optimization problems. Many of these models are NP-hard and, as a result, exact methods may be impractical for large scale problem instances. Consequently, there is a great interest in developing e±cient approximate methods that yield near-optimal solutions in acceptable computational times. A class of such methods, known as metaheuristics, have been proposed with success. This thesis considers some recently proposed NP-hard combinatorial optimization problems formulated on graphs. In particular, the min-

APA, Harvard, Vancouver, ISO, and other styles

19

Cowlagi, Raghvendra V. "Hierarchical motion planning for autonomous aerial and terrestrial vehicles." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41066.

Full text

Abstract:

Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of th

APA, Harvard, Vancouver, ISO, and other styles

20

Anguelov, Bobby. "Video game pathfinding and improvements to discrete search on grid-based maps." Diss., University of Pretoria, 2011. http://hdl.handle.net/2263/22940.

Full text

Abstract:

The most basic requirement for any computer controlled game agent in a video game is to be able to successfully navigate the game environment. Pathfinding is an essential component of any agent navigation system. Pathfinding is, at the simplest level, a search technique for finding a route between two points in an environment. The real-time multi-agent nature of video games places extremely tight constraints on the pathfinding problem. This study aims to provide the first complete review of the current state of video game pathfinding both in regards to the graph search algorithms employed as w

APA, Harvard, Vancouver, ISO, and other styles

21

Tran, The Truyen. "On conditional random fields: applications, feature selection, parameter estimation and hierarchical modelling." Thesis, Curtin University, 2008. http://hdl.handle.net/20.500.11937/436.

Full text

Abstract:

There has been a growing interest in stochastic modelling and learning with complex data, whose elements are structured and interdependent. One of the most successful methods to model data dependencies is graphical models, which is a combination of graph theory and probability theory. This thesis focuses on a special type of graphical models known as Conditional Random Fields (CRFs) (Lafferty et al., 2001), in which the output state spaces, when conditioned on some observational input data, are represented by undirected graphical models. The contributions of thesis involve both (a) broadening

APA, Harvard, Vancouver, ISO, and other styles

22

Jezný, Lukáš. "Automatické rozvržení diagramů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-412807.

Full text

Abstract:

Automatic layouts for diagram drawing is described in this paper. Major methods, algorithms, metrics for automatic layouts are introduced in theretical part. Practical part of this work was developing algorithms for automatic layouts of organizational structures and business process model diagrams.

APA, Harvard, Vancouver, ISO, and other styles

23

Alessi, Nicola. "Hierarchical Inter-Regional Routing Algorithm for Interplanetary Networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17468/.

Full text

Abstract:

Le comunicazioni interplanetarie sono caratterizzate da lunghi ritardi, perdite elevate e connettività intermittente con frequenti interruzioni. Lo stack TCP/IP è inadatto nell'affrontare questo tipo di problemi. Mentre inizialmente l'unico scenario di riferimento erano le comunicazioni interplanetarie, negli anni successivi è nato il termine "Challenged Networks" per identificare le reti in cui i protocolli tradizionali falliscono. L'idea si evolve così in Delay/Disruption Tolerant Networking(DTN), con l'obiettivo di fornire una soluzione adatta alle challenged network. Tra i vari aspetti in

APA, Harvard, Vancouver, ISO, and other styles

24

Charpentier, Bertrand. "Multi-scale clustering in graphs using modularity." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847.

Full text

Abstract:

This thesis provides a new hierarchical clustering algorithm for graphs, named Paris, which can be interpreted through the modularity score and its resolution parameter. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. It tries to approximate the optimal partitions with respect to the modularity score at any resolution in one run. In addition to the Paris hierarchical algorithm, this thesis proposes four algorithms that compute rankings of the sharpest clusters, clusterings and resolutions by processing the hierar

APA, Harvard, Vancouver, ISO, and other styles

25

Tran, The Truyen. "On conditional random fields: applications, feature selection, parameter estimation and hierarchical modelling." Curtin University of Technology, Dept. of Computing, 2008. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=18614.

Full text

Abstract:

There has been a growing interest in stochastic modelling and learning with complex data, whose elements are structured and interdependent. One of the most successful methods to model data dependencies is graphical models, which is a combination of graph theory and probability theory. This thesis focuses on a special type of graphical models known as Conditional Random Fields (CRFs) (Lafferty et al., 2001), in which the output state spaces, when conditioned on some observational input data, are represented by undirected graphical models. The contributions of thesis involve both (a) broadening

APA, Harvard, Vancouver, ISO, and other styles

26

Depardon, Benjamin. "Contribution to the Deployment of a Distributed and Hierarchical Middleware Applied to Cosmological Simulations." Lyon, Ecole normale supérieure, 2010. http://www.theses.fr/2010ENSL0585.

Full text

Abstract:

Les travaux présentés dans cette thèse portent sur l’exécution d’applications sur les environnements hétérogènes et distribués que sont les grilles de calcul. Nous étudions de bout en bout le processus permettant à des utilisateurs d’exécuter des applications scientifiques complexes. Les contributions de cette thèse se situent donc à plusieurs niveaux. 1) Déploiement d’intergiciel hiérarchique : nous proposons dans un premier temps un modèle d’exécution pour les intergiciels hiérarchiques. À partir de ce modèle, nous présentons plusieurs heuristiques pour définir automatiquement la meilleure h

APA, Harvard, Vancouver, ISO, and other styles

27

Chang, Ran. "Effective Graph-Based Content--Based Image Retrieval Systems for Large-Scale and Small-Scale Image Databases." DigitalCommons@USU, 2013. https://digitalcommons.usu.edu/etd/2123.

Full text

Abstract:

This dissertation proposes two novel manifold graph-based ranking systems for Content-Based Image Retrieval (CBIR). The two proposed systems exploit the synergism between relevance feedback-based transductive short-term learning and semantic feature-based long-term learning to improve retrieval performance. Proposed systems first apply the active learning mechanism to construct users' relevance feedback log and extract high-level semantic features for each image. These systems then create manifold graphs by incorporating both the low-level visual similarity and the high-level semantic simil

APA, Harvard, Vancouver, ISO, and other styles

28

MITSUMATSU, Sawako, Takeshi FURUHASHI, Tomohiro YOSHIKAWA та ін. "階層的可視化手法を用いたアソシエーション分析によるプロファイリング". 日本感性工学会, 2011. http://hdl.handle.net/2237/20697.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Rodríguez, Sánchez Fernando. "Impact of technology readiness in the development of automotive systems when incorporating new styling : a graph theory approach to OPM hierarchical decomposition of the system's architecture." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/107345.

Full text

Abstract:

Thesis: S.M. in Engineering and Management, Massachusetts Institute of Technology, School of Engineering, Institute for Data, Systems, and Society, System Design and Management Program, 2014.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (page 55).<br>This thesis addresses to find whether technology readiness, while developing a system of new derivative vehicles, has an influence on the time required to design a part that involves styling and engineering activities. For doing so Styling Level and Technology Readiness were identified as independent variables, w

APA, Harvard, Vancouver, ISO, and other styles

30

Lima, Daniel Mário de. "Análise visual de dados relacionais: uma abordagem interativa suportada por teoria dos grafos." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05052014-155415/.

Full text

Abstract:

Bancos de dados relacionais são fontes de dados rigidamente estruturadas, caracterizadas por relacionamentos complexos entre um conjunto de relações (tabelas). Entender tais relacionamentos é um desafio, porque os usuários precisam considerar múltiplas relações, entender restrições de integridade, interpretar vários atributos, e construir consultas SQL para cada tentativa de exploração. Neste cenário, introduz-se uma metodologia em duas etapas; primeiro utiliza-se um grafo organizado como uma estrutura hierárquica para modelar os relacionamentos do banco de dados, e então, propõe-se uma nova t

APA, Harvard, Vancouver, ISO, and other styles

31

Cunningham, James. "Efficient, Parameter-Free Online Clustering." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1606762403895603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

NICOLUSSI, FEDERICA. "Marginal parametrizations for conditional independence models and graphical models for categorical data." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2013. http://hdl.handle.net/10281/43679.

Full text

Abstract:

The graphical models (GM) for categorical data are models useful to representing conditional independencies through graphs. The parametric marginal models for categorical data have useful properties for the asymptotic theory. This work is focused on nding which GMs can be represented by marginal parametrizations. Following theorem 1 of Bergsma, Rudas and Németh [9], we have proposed a method to identify when a GM is parametrizable according to a marginal model. We have applied this method to the four types of GMs for chain graphs, summarized by Drton [22]. In particular, with regard to

APA, Harvard, Vancouver, ISO, and other styles

33

Dorrian, Henry Joseph. "Hierarchical graphs and oscillator dynamics." Thesis, Manchester Metropolitan University, 2015. http://e-space.mmu.ac.uk/580120/.

Full text

Abstract:

In many types of network, the relationship between structure and function is of great significance. This work is particularly concerned with community structures, which arise in a wide variety of domains. A simple oscillator model is applied to networks with community structures and shows that waves of regular oscillation are caused by synchronised clusters of nodes. Moreover, we demonstrate that such global oscillations may arise as a direct result of network topology. We also observe that additional modes of oscillation (as detected through frequency analysis) occur in networks with addition

APA, Harvard, Vancouver, ISO, and other styles

34

Zentner, John Marc. "A Design Space Exploration Process for Large Scale, Multi-Objective Computer Simulations." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11572.

Full text

Abstract:

The primary contributions of this thesis are associated with the development of a new method for exploring the relationships between inputs and outputs for large scale computer simulations. Primarily, the proposed design space exploration procedure uses a hierarchical partitioning method to help mitigate the curse of dimensionality often associated with the analysis of large scale systems. Closely coupled with the use of a partitioning approach, is the problem of how to partition the system. This thesis also introduces and discusses a quantitative method developed to aid the user in finding a

APA, Harvard, Vancouver, ISO, and other styles

35

Zini, Roger. "Placement, routage conjoints et hierarchiques de reseaux prediffuses." Paris 6, 1987. http://www.theses.fr/1987PA066116.

Full text

Abstract:

Cette these propose un algorithme original de construction hierarchique d'arbres de steiner ainsi qu'une technique d'estimation de longueur au fur et a mesure de cette construction. Deux algorithmes de partitionnement d'hypergraphes, de maniere gloutonne ou par recuit simule sans rejets, y sont exposes. Elle introduit enfin un concept de directions d'attraction permettant d'effectuer un placement routage de circuits vlsi, a implanter sur des reseaux prediffuses, sous forme de systeme regule par retroaction entre le placement, le routage et l'analyse temporelle, afin d'obtenir du circuit, par u

APA, Harvard, Vancouver, ISO, and other styles

36

Puch-Solis, Roberto O. "Hierarchical junction trees." Thesis, University of Warwick, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365243.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Hudec, Lukáš. "Systémy dálkového měření v energetice." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-218880.

Full text

Abstract:

The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate

APA, Harvard, Vancouver, ISO, and other styles

38

Reynolds, Jason. "A hierarchical layout algorithm for drawing directed graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq20694.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Randrianasoa, Tianatahina Jimmy Francky. "Représentation d'images hiérarchique multi-critère." Thesis, Reims, 2017. http://www.theses.fr/2017REIMS040/document.

Full text

Abstract:

La segmentation est une tâche cruciale en analyse d’images. L’évolution des capteurs d’acquisition induit de nouvelles images de résolution élevée, contenant des objets hétérogènes. Il est aussi devenu courant d’obtenir des images d’une même scène à partir de plusieurs sources. Ceci rend difficile l’utilisation des méthodes de segmentation classiques. Les approches de segmentation hiérarchiques fournissent des solutions potentielles à ce problème. Ainsi, l’Arbre Binaire de Partitions (BPT) est une structure de données représentant le contenu d’une image à différentes échelles. Sa construction

APA, Harvard, Vancouver, ISO, and other styles

40

Wallgrün, Jan Oliver. "Hierarchical Voronoi graphs spatial representation and reasoning for mobile robots." Berlin Heidelberg Springer, 2008. http://d-nb.info/99728210X/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Raitner, Marcus. "Efficient visual navigation a study by the example of hierarchically structured graphs." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=978647084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Santana, Maia Deise. "A study of hierarchical watersheds on graphs with applications to image segmentation." Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC2069.

Full text

Abstract:

La littérature abondante sur la théorie des graphes invite de nombreux problèmes à être modélisés dans ce cadre. En particulier, les algorithmes de regroupement et de segmentation conçus dans ce cadre peuvent être utilisés pour résoudre des problèmes dans de nombreux domaines tels que l'analyse d'image qui est le principal domaine d'application de cette thèse. Dans ce travail, nous nous concentrons sur un outil de segmentation semi-supervisé largement étudié dans la morphologie mathématique et appliqué à l'analyse d'image, notamment les Ligne de Partage des Eaux (LPE). Nous étudions la notion

APA, Harvard, Vancouver, ISO, and other styles

43

Stoffel, Edgar-Philipp. "Hierarchical graphs as organisational principle and spatial model applied to pedestrian indoor navigation." Diss., kostenfrei, 2009. http://edoc.ub.uni-muenchen.de/10620/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Olifer, Maksim. "Architectural model synthesis from source code using Simulink and Hierarchical Function Call-Graphs." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296883.

Full text

Abstract:

Modern software systems developed in the automotive industry are very complex. In order to analyze, understand, and document these software systems, architectural models of the systems at different abstraction levels are used. However, these models are typically ambiguous and inconsistent with the implementation. This thesis presents an approach to construct an unambiguous model of C code in an automatic manner, with a focus on architecture consistency by employing the Simulink environment extended by an external custom GUI. Such approach also facilitates compliance with the functional safety

APA, Harvard, Vancouver, ISO, and other styles

45

Decelle, Aurélien. "Statistical physics of disordered networks - Spin Glasses on hierarchical lattices and community inference on random graphs." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00653375.

Full text

Abstract:

Cette thèse aborde des aspects fondamentales et appliquées de la théorie des verres de spin etplus généralement des systèmes complexes. Les premiers modèles théoriques décrivant la transitionvitreuse sont apparues dans les années 1970. Ceux-ci décrivaient les verres à l'aide d'interactionsaléatoires. Il a fallu alors plusieurs années avant qu'une théorie de champs moyen pour ces systèmessoient comprises. De nos jours il existe un grand nombre de modèles tombant dans la classe de" champs moyen " et qui sont bien compris à la fois analytiquement, mais également numériquementgrâce à des outils te

APA, Harvard, Vancouver, ISO, and other styles

46

Mazari, Ahmed. "Apprentissage profond pour la reconnaissance d’actions en vidéos." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS171.

Full text

Abstract:

De nos jours, les contenus vidéos sont omniprésents grâce à Internet et les smartphones, ainsi que les médias sociaux. De nombreuses applications de la vie quotidienne, telles que la vidéo surveillance et la description de contenus vidéos, ainsi que la compréhension de scènes visuelles, nécessitent des technologies sophistiquées pour traiter les données vidéos. Il devient nécessaire de développer des moyens automatiques pour analyser et interpréter la grande quantité de données vidéo disponibles. Dans cette thèse, nous nous intéressons à la reconnaissance d'actions dans les vidéos, c.a.d au pr

APA, Harvard, Vancouver, ISO, and other styles

47

Морозов, Костянтин В’ячеславович. "Методи і засоби побудови моделей поведінки небазових відмовостійких багатопроцесорних систем". Doctoral thesis, Київ, 2021. https://ela.kpi.ua/handle/123456789/40485.

Full text

Abstract:

Дисертація присвячена проблемі побудови графо-логічних моделей (GL-моделей) небазових відмовостійких багатопроцесорних систем (ВБС) з метою розрахунку їх параметрів надійності шляхом проведення статистичних експериментів із вищезгаданими моделями. Запропоновано метод перетворення GL-моделей за рахунок модифікації виразу будь-якої реберної функції так званої МВР-моделі. Метод базуються на зміні як однієї, так і обох частин виразу реберної функції та дозволяє модифікувати модель так, що на деяких векторах стану системи вона, на відміну від оригінальної, починає показувати роботозд

APA, Harvard, Vancouver, ISO, and other styles

48

Cuenca, Pauta Erick. "Visualisation de données dynamiques et complexes : des séries temporelles hiérarchiques aux graphes multicouches." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS054/document.

Full text

Abstract:

L'analyse de données de plus en plus complexes, volumineuses et issues de différentes sources (e.g. internet, médias sociaux, etc.) est une tâche difficile. Elle reste cependant cruciale dans de très nombreux domaines d'application. Elle implique, pour pouvoir en extraire des connaissances, de mieux comprendre la nature des données, leur évolution ou les nombreuses relations complexes qu'elles peuvent contenir. La visualisation d'informations s'intéresse aux méthodes de représentations visuelles et interactives permettant d'aider un utilisateur à extraire des connaissances. C'est dans ce conte

APA, Harvard, Vancouver, ISO, and other styles

49

Sansen, Joris. "La visualisation d’information pour les données massives : une approche par l’abstraction de données." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0636/document.

Full text

Abstract:

L’évolution et la démocratisation des technologies ont engendré une véritable explosion de l’information et notre capacité à générer des données et le besoin de les analyser n’a jamais été aussi important. Pourtant, les problématiques soulevées par l’accumulation de données (stockage, temps de traitement, hétérogénéité, vitesse de captation/génération, etc. ) sont d’autant plus fortes que les données sont massives, complexes et variées. La représentation de l’information, de part sa capacité à synthétiser et à condenser des données, se constitue naturellement comme une approche pour les analys

APA, Harvard, Vancouver, ISO, and other styles

50

Reda, Fatima Al. "Modélisation de mouvement de foules avec contraintes variées." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS235/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à la modélisation de mouvements de foules. Nous proposons un modèle microscopique basé sur la théorie des jeux. Chaque individu a une certaine vitesse souhaitée, celle qu'il adopterait en l'absence des autres. Une personne est influencée par certains de ses voisins, pratiquement ceux qu'elle voit devant elle. Une vitesse réelle est considérée comme possible si elle réalise un équilibre de Nash instantané: chaque individu fait son mieux par rapport à un objectif personnel (vitesse souhaitée), en tenant compte du comportement des voisins qui l'influencent.

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!