Log in

Relevant bibliographies by topics / Tree matching / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Tree matching.

Dissertations / Theses on the topic 'Tree matching'

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 'Tree matching.'

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

宋永健 and Wing-kin Sung. "Fast labeled tree comparison via better matching algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31239316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sung, Wing-kin. "Fast labeled tree comparison via better matching algorithms /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20229999.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Baseski, Emre. "Context-sensitive Matching Of Two Shapes." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607353/index.pdf.

Full text

Abstract:

The similarity between two shapes is typically calculated by measuring how well the properties and the spatial organization of the primitives forming the shapes agree. But, when this calculations are done independent from the context, i.e. the whole set of shapes in the experiments, a priori significance to the primitives is assigned, which may cause problematic similarity measures. A possible way of using context information in similarity measure between shape A and shape B is using the category information of shape B in calculations. In this study, shapes are represented as depth-1 shape tre

APA, Harvard, Vancouver, ISO, and other styles

4

Leavitt, Steven W., Austin Long, and Jeffrey S. Dean. "Tree-Ring Dating Through Pattern-Matching of Stable-Carbon Isotope Time Series." Tree-Ring Society, 1985. http://hdl.handle.net/10150/261321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hogue, Andrew William 1978. "Tree pattern inference and matching for wrapper induction on the World Wide Web." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28406.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (p. 103-106).<br>We develop a method for learning patterns from a set of positive examples to retrieve semantic content from tree-structured data. Specifically, we focus on HTML documents on the World Wide Web, which contain a wealth of semantic information and have a useful underlying tree structure. A user provides examples of relevant data they wish to extract from a web site through a simple user interface in a web browser. To construct

APA, Harvard, Vancouver, ISO, and other styles

6

Geyer, Alois, Michael Hanke, and Alex Weissensteiner. "Scenario Tree Generation and Multi-Asset Financial Optimization Problems." Elsevier, 2013. http://dx.doi.org/10.1016/j.orl.2013.06.003.

Full text

Abstract:

We compare two popular scenario tree generation methods in the context of financial optimization: Moment matching and scenario reduction. Using a simple problem with a known analytic solution, we find that moment matching - accompanied by a check to ensure absence of arbitrage opportunities - replicates this solution precisely. On the other hand, even if the scenario trees generated by scenario reduction are arbitrage-free, the solutions to the approximate optimization problem represented by the reduced tree are biased and highly variable. These results hold for correlated and uncorrelate

APA, Harvard, Vancouver, ISO, and other styles

7

Saleem, Khalid. "Schema Matching and Integration in Large Scale Scenarios." Montpellier 2, 2008. http://www.theses.fr/2008MON20126.

Full text

Abstract:

Le besoin d'intégrer et d'analyser des grands ensembles de données issus des bases de données publiées sur le web est présent dans de nombreux domaines d'applications comme la génomique, l'environnement, la médecine et le commerce électronique. Ces données sont, après intégration, utilisées pour prendre des décisions, des échanges de services, etc. Les outils existants pour la découverte de correspondances (appelés matchers) permettent de traiter les schémas deux par deux et nécessitent l'intervention d'un expert afin de garantir une bonne qualité des correspondances. Dans un scénario de large

APA, Harvard, Vancouver, ISO, and other styles

8

Bodas, Shalmali Vidyadhar. "Improved association graph matching of intra-patient airway trees." Thesis, University of Iowa, 2008. https://ir.uiowa.edu/etd/197.

Full text

Abstract:

Pulmonary diseases are frequently associated with changes in lung anatomy. These diseases may change the airway, vessel and lung tissue properties. In order to evaluate the lung in a longitudinal study, a stable reference system is required to identify corresponding parts of the lung. The structure of the airway tree can be used to repeatedly identify the regions of interest. In this study, an improved method for matching of intra-patient airway trees was proposed and evaluated. The association graph method proposed by Pelillo et al. matches free and rooted trees by detecting the maximal sub-t

APA, Harvard, Vancouver, ISO, and other styles

9

Chowdhury, Israt Jahan. "Knowledge discovery from tree databases using balanced optimal search." Thesis, Queensland University of Technology, 2016. https://eprints.qut.edu.au/92263/1/Israt%20Jahan_Chowdhury_Thesis.pdf.

Full text

Abstract:

This research is a step forward in discovering knowledge from databases of complex structure like tree or graph. Several data mining algorithms are developed based on a novel representation called Balanced Optimal Search for extracting implicit, unknown and potentially useful information like patterns, similarities and various relationships from tree data, which are also proved to be advantageous in analysing big data. This thesis focuses on analysing unordered tree data, which is robust to data inconsistency, irregularity and swift information changes, hence, in the era of big data it becomes

APA, Harvard, Vancouver, ISO, and other styles

10

Buatongkue, Sirisuda. "Personal named entity linking based on simple partial tree matching and context free grammar." Thesis, Heriot-Watt University, 2017. http://hdl.handle.net/10399/3265.

Full text

Abstract:

Personal name disambiguation is the task of linking a personal name to a unique comparable entry in the real world, also known as named entity linking (NEL). Algorithms for NEL consist of three main components: extractor, searcher, and disambiguator. Existing approaches for NEL use exact-matched look-up over the surface form to generate a set of candidate entities in each of the mentioned names. The exact-matched look-up is wholly inadequate to generate a candidate entity due to the fact that the personal names within a web page lack uniform representation. In addition, the performance of a di

APA, Harvard, Vancouver, ISO, and other styles

11

Zhou, Steven. "A Novel Approach to Iris Localization and Code Matching for Iris Recognition." NSUWorks, 2009. http://nsuworks.nova.edu/gscis_etd/346.

Full text

Abstract:

In recent years, computing power and biometric sensors have not only become more powerful, but also more affordable to the general public. In turn, there has been great interest in developing and deploying biometric personal ID systems. Unlike the conventional security systems that often require people to provide artificial identification for verification, i.e. password or algorithmic generated keys, biometric security systems use an individual's biometric measurements, including fingerprint, face, hand geometry, and iris. It is believed that these measurements are unique to the individual, ma

APA, Harvard, Vancouver, ISO, and other styles

12

Ifrah, Philip Isaac. "Tree search and singular value decomposition, a comparison of two strategies for point-pattern matching." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq29602.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Ifrah, Philip. "Tree search and singular value decomposition : a comparison of two strategies for point-pattern matching." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27229.

Full text

Abstract:

Two approaches for solving point-pattern matching problems are compared; namely, a graph-matching algorithm (1) and an SVD-based procedure (2). In both cases, the features that are used in the matching process are point coordinates in Euclidean n-space, ${ rm I !E} sp{n}.$ The patterns being matched are assumed to be related by a combination of two transformations: (1) a permutation of the feature points which establishes the correspondence between the feature points of the different patterns and (2) a global geometric transformation based on rigid motions which aligns the patterns once the po

APA, Harvard, Vancouver, ISO, and other styles

14

Morales, Pinzon Alfredo. "Lung segmentation and airway tree matching : application to aeration quantification in CT images of subjects with ARDS." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1019/document.

Full text

Abstract:

Le syndrome de détresse respiratoire aiguë (SDRA) présente un taux de mortalité élevé, près de 40%, dans des unités de soins intensifs. Il est défini comme un ensemble de manifestations cliniques, radiologiques et physiologiques qui traduisent une intense inflammation pulmonaire et une hyperperméabilité pulmonaire, correspondant aux différentes agressions aiguës du poumon. Le prise en charge des patients atteints du SDRA nécessite une ventilation assistée qui, en cas de mauvaise adaptation des paramètres de ventilation, notamment, pression et volume, peut aggraver l'état du patient. Le réglage

APA, Harvard, Vancouver, ISO, and other styles

15

Pomerleau, François. "Registration algorithm optimized for simultaneous localization and mapping." Mémoire, Université de Sherbrooke, 2008. http://savoirs.usherbrooke.ca/handle/11143/1465.

Full text

Abstract:

Building maps within an unknown environment while keeping track of the current position is a major step to accomplish safe and autonomous robot navigation. Within the last 20 years, Simultaneous Localization And Mapping (SLAM) became a topic of great interest in robotics. The basic idea of this technique is to combine proprioceptive robot motion information with external environmental information to minimize global positioning errors. Because the robot is moving in its environment, exteroceptive data comes from different points of view and must be expressed in the same coordinate system to be

APA, Harvard, Vancouver, ISO, and other styles

16

Alves, do Valle Junior Eduardo. "Local-Descriptor Matching for Image Identification Systems." Cergy-Pontoise, 2008. http://biblioweb.u-cergy.fr/theses/08CERG0351.pdf.

Full text

Abstract:

L'identification d'images (ou la détection des copies) consiste à retrouver l'original d’où est issue une image requête ainsi que les metadonnées associées, telles que titres, auteurs, droits de reproduction, etc. . . La tâche est difficile en raison de la variété des transformations que l'image originale peut avoir subi. Les systèmes d'identification d'images basées sur des descripteurs locaux ont montré une excellente efficacité, mais souffrent souvent des problèmes de rapidité d'exécution car, des centaines, voire des milliers de descripteurs, doivent être appariés afin de trouver une seule

APA, Harvard, Vancouver, ISO, and other styles

17

BERNARDINI, GIULIA. "COMBINATORIAL METHODS FOR BIOLOGICAL DATA." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2021. http://hdl.handle.net/10281/305220.

Full text

Abstract:

Lo scopo di questa tesi è di elaborare e analizzare metodi rigorosi dal punto di vista matematico per l’analisi di due tipi di dati biologici: dati relativi a pan-genomi e filogenesi. Con il termine “pan-genoma” si indica, in generale, un insieme di sequenze genomiche strettamente correlate (tipicamente appartenenti a individui della stessa specie) che si vogliano utilizzare congiuntamente come sequenze di riferimento per un’intera popolazione. Una filogenesi, invece, rappresenta le relazioni evolutive in un gruppo di entità, che siano esseri viventi, geni, lingue naturali, manoscritti antichi

APA, Harvard, Vancouver, ISO, and other styles

18

Nakamura, T., M. Okuno, K. Kimura, et al. "Application Of ¹⁴C Wiggle-Matching To Support Dendrochronological Analysis In Japan." Tree-Ring Society, 2007. http://hdl.handle.net/10150/622549.

Full text

Abstract:

¹⁴C wiggle-matching was applied to two wood samples closely related to geological and archaeological events with associated dendrochronological dates, to demonstrate the accuracy of ¹⁴C dating with accelerator mass spectrometry (AMS). Wiggle-matching on charred wood with bark, excavated from a pyroclastic mud-flow deposited by the huge 10th Century eruption of the Baitoushan Volcano, revealed the eruption age as cal A.D. 935 +8/-5 with 95% confidence. This date is consistent with the eruption age of A.D. 912 to A.D. 972 estimated by dendrochronology on two wooden boards that had clear stratig

APA, Harvard, Vancouver, ISO, and other styles

19

Zelke, Mariano. "Algorithms for streaming graphs." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2009. http://dx.doi.org/10.18452/15912.

Full text

Abstract:

Für einen Algorithmus zum Lösen eines Graphenproblems wird üblicherweise angenommen, dieser sei mit wahlfreiem Zugriff (random access) auf den Eingabegraphen G ausgestattet, als auch mit einem Arbeitsspeicher, der G vollständig aufzunehmen vermag. Diese Annahmen erweisen sich als fragwürdig, wenn Graphen betrachtet werden, deren Größe jene konventioneller Arbeitsspeicher übersteigt. Solche Graphen können nur auf externen Speichern wie Festplatten oder Magnetbändern vorrätig gehalten werden, auf denen wahlfreier Zugriff sehr zeitaufwändig ist. Um riesige Graphen zu bearbeiten, die auf extern

APA, Harvard, Vancouver, ISO, and other styles

20

Bigot, Thomas. "Recherche automatisée de motifs dans les arbres phylogénétiques." Phd thesis, Université Claude Bernard - Lyon I, 2013. http://tel.archives-ouvertes.fr/tel-01044878.

Full text

Abstract:

La phylogénie permet de reconstituer l'histoire évolutive de séquences ainsi que des espèces qui les portent. Les récents progrès des méthodes de séquençage ont permis une inflation du nombre de séquences disponibles et donc du nombre d'arbres de gènes qu'il est possible de construire. La question qui se pose est alors d'optimiser la recherche d'informations dans ces arbres. Cette recherche doit être à la fois exhaustive et efficace. Pour ce faire, mon travail de thèse a consisté en l'écriture puis en l'utilisation d'un ensemble de programmes capables de parcourir et d'annoter les arbres phylo

APA, Harvard, Vancouver, ISO, and other styles

21

Jia, Xiuping Electrical Engineering Australian Defence Force Academy UNSW. "Classification techniques for hyperspectral remote sensing image data." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Electrical Engineering, 1996. http://handle.unsw.edu.au/1959.4/38713.

Full text

Abstract:

Hyperspectral remote sensing image data, such as that recorded by AVIRIS with 224 spectral bands, provides rich information on ground cover types. However, it presents new problems in machine assisted interpretation, mainly in long processing times and the difficulties of class training due to the low ratio of number of training samples to the number of bands. This thesis investigates feasible and efficient feature reduction and image classification techniques which are appropriate for hyperspectral image data. The study is reported in three parts. The first concerns a deterministic approach

APA, Harvard, Vancouver, ISO, and other styles

22

Prelipcean, Adrian Corneliu. "Implementation and evaluation of Space Time Alarm Clock." Thesis, KTH, Geodesi och geoinformatik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157533.

Full text

Abstract:

Many modern mobile communication devices are equipped with a GPS receiver and anavigation tool. These devices are useful when a user seeks to reach a specified destinationas soon as possible, but may not be so when he/she only needs to arrive at thedestination in time and wants to focus on some activities on the way. To deal with thislatter situation, a method and device called “Space Time Alarm Clock” is presented forhelping the user reach the destination by a specified deadline and inform the user aboutthe consequences of his/her decisions. It does so by continuously and efficiently computin

APA, Harvard, Vancouver, ISO, and other styles

23

Moradi, Arvin. "Smart Clustering System for Filtering and Cleaning User Generated Content : Creating a profanity filter for Truecaller." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-124408.

Full text

Abstract:

This thesis focuses on investigating and creating an application for filtering user-generated content. The method was to examine how profanity and racist expressions are used and manipulated to evade filtering processes in similar systems. Focus also went on to study different algorithms to get this process to be quick and efficient, i.e., to process as many names in the shortest amount of time possible. This is because the client needs to filter millions of new uploads every day. The result shows that the application detects profanity and manipulated profanity. Data from the customer’s databa

APA, Harvard, Vancouver, ISO, and other styles

24

Mattes, Julian. "Invariants statistiques et structurels définis par l'arbre de confinement pour le recalage d'images et l'analyse du mouvement." Université Joseph Fourier (Grenoble ; 1971-2015), 2000. http://www.theses.fr/2000GRE10247.

Full text

Abstract:

En imagerie médicale, nous sommes confrontés au problème consistant à recaler deux images des mêmes objets, obtenues après des mouvements ou des déformations, ou après une perte de l'orientation d'une image par rapport à l'autre. Dans le cadre de cette thèse, nous avons introduit une nouvelle méthodologie pour nous attaquer à ce problème: elle consiste à suivre les composantes connexes des ensembles de niveau de la fonction de niveau de gris (les conineurs) en utilisant la structure hiérarchique (arbre de confinement) qu'elles forment, prises à différents niveaux. Les propriétés d'invariance d

APA, Harvard, Vancouver, ISO, and other styles

25

Lima, Murilo Santos de. "Aproximação de métricas finitas por métricas arbóreas e aplicações." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13032012-201516/.

Full text

Abstract:

Muitos problemas de otimização em grafos, em especial problemas métricos, são mais fáceis de resolver em árvores. Portanto, uma estratégia para obter um bom algoritmo para certos problemas é obter uma árvore que aproxime o grafo, e utilizar uma solução do problema nessa árvore como uma solução aproximada para o problema no grafo original. Neste trabalho é estudada a técnica de Fakcharoenphol, Rao e Talwar, que mostraram como aproximar uma métrica finita arbitrária com n pontos por uma métrica numa árvore com distorção esperada O(lg n) -- o ótimo assintótico. Essa estratégia resulta em algoritm

APA, Harvard, Vancouver, ISO, and other styles

26

Nakamura, Toshio, Takayuki Omori, 俊夫中村 та 貴之大森. "トルコ共和国カマン・カレホユック遺跡前期鉄器時代の^<14>C変動について". 名古屋大学年代測定資料研究センター, 2010. http://hdl.handle.net/2237/14755.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Mattes, Julian. "Invariants statistiques et structurels définis par l'arbre de confinement pour le recalage d'images et l'analyse du mouvement." Université Joseph Fourier (Grenoble), 2000. http://www.theses.fr/2000GRE1A002.

Full text

Abstract:

En imagerie médicale, nous sommes confrontés au problème consistant à recaler deux images des mêmes objets, obtenues après des mouvements ou des déformations, ou après une perte de l'orientation d'une image par rapport à l'autre. Dans le cadre de cette thèse, nous avons introduit une nouvelle méthodologie pour nous attaquer à ce problème: elle consiste à suivre les composantes connexes des ensembles de niveau de la fonction de niveau de gris (les conineurs) en utilisant la structure hiérarchique (arbre de confinement) qu'elles forment, prises à différents niveaux. Les propriétés d'invariance d

APA, Harvard, Vancouver, ISO, and other styles

28

Contreras, Biekert José. "Olimpiadas, externalidades y matching tres ensayos en microeconomía." Tesis, Universidad de Chile, 2014. http://www.repositorio.uchile.cl/handle/2250/130300.

Full text

Abstract:

Tesis para optar al grado de Doctor en Economía<br>This thesis consists of three essays in microeconomics. The first is related to empirical analysis. Particularly, this work study the impact on future performance in Summer Olympic Games for a country which has been host of the event. This study can be seen as another argument in favour of the literature that studies the relationship between economic impact and such events. It is found that the positive effect of being host –measured as medal count– disappears immediately in the next period. This result is robust to a set estimation metho

APA, Harvard, Vancouver, ISO, and other styles

29

Feuillâtre, Hélène. "Détermination automatique de l'incidence optimale pour l'observation des lésions coronaires en imagerie rotationnelle R-X." Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S039/document.

Full text

Abstract:

Les travaux de cette thèse s’inscrivent dans le cadre du planning de traitements minimalement invasifs des lésions des artères coronaires. Le cardiologue réalise un examen coronarographique, puis dans la continuité, une angioplastie transluminale. L’angiographie rotationnelle à rayons X permet de visualiser sous différentes incidences 2D la lumière des artères coronaires sur plusieurs cycles cardiaques et aussi d’obtenir une reconstruction 3D+T des arbres coronaires. A partir de cette séquence, notre objectif est de déterminer automatiquement une incidence optimale 2D du segment sténosé compat

APA, Harvard, Vancouver, ISO, and other styles

30

Bonsma, Paul Simon. "Sparse cuts, matching-cuts and leafy trees in graphs." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/57117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Keng, Leng Hui. "Approximate String Matching With Dynamic Programming and Suffix Trees." UNF Digital Commons, 2006. http://digitalcommons.unf.edu/etd/196.

Full text

Abstract:

The importance and the contribution of string matching algorithms to the modern society cannot be overstated. From basic search algorithms such as spell checking and data querying, to advanced algorithms such as DNA sequencing, trend analysis and signal processing, string matching algorithms form the foundation of many aspects in computing that have been pivotal in technological advancement. In general, string matching algorithms can be divided into the categories of exact string matching and approximate string matching. We study each area and examine some of the well known algorithms. We prob

APA, Harvard, Vancouver, ISO, and other styles

32

Tahraoui, Mohammed Amin. "Coloring, packing and embedding of graphs." Phd thesis, Université Claude Bernard - Lyon I, 2012. http://tel.archives-ouvertes.fr/tel-00995041.

Full text

Abstract:

In this thesis, we investigate some problems in graph theory, namelythe graph coloring problem, the graph packing problem and tree pattern matchingfor XML query processing. The common point between these problems is that theyuse labeled graphs.In the first part, we study a new coloring parameter of graphs called the gapvertex-distinguishing edge coloring. It consists in an edge-coloring of a graph G whichinduces a vertex distinguishing labeling of G such that the label of each vertex isgiven by the difference between the highest and the lowest colors of its adjacentedges. The minimum number of

APA, Harvard, Vancouver, ISO, and other styles

33

Schubert, Stefan. "Optimierter Einsatz eines 3D-Laserscanners zur Point-Cloud-basierten Kartierung und Lokalisierung im In- und Outdoorbereich." Master's thesis, Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-161415.

Full text

Abstract:

Die Kartierung und Lokalisierung eines mobilen Roboters in seiner Umgebung ist eine wichtige Voraussetzung für dessen Autonomie. In dieser Arbeit wird der Einsatz eines 3D-Laserscanners zur Erfüllung dieser Aufgaben untersucht. Durch die optimierte Anordnung eines rotierenden 2D-Laserscanners werden hochauflösende Bereiche vorgegeben. Zudem wird mit Hilfe von ICP die Kartierung und Lokalisierung im Stillstand durchgeführt. Bei der Betrachtung zur Verbesserung der Bewegungsschätzung wird auch eine Möglichkeit zur Lokalisierung während der Bewegung mit 3D-Scans vorgestellt. Die vorgestellten Alg

APA, Harvard, Vancouver, ISO, and other styles

34

Neto, Domingos Soares. "Filtros para a busca e extração de padrões aproximados em cadeias biológicas." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/.

Full text

Abstract:

Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se nos dois problemas a seguir, considerando-os sob as distâncias de Hamming e Levenshtein: a) como determinar os locais nos quais um dado padrão ocorre de modo aproximado em uma cadeia fornecida; b) como extrair padrões que ocorram de modo aproximado em um número significativo de cadeias de um conjunto fornecido. O primeiro problema, para o qual já existem diversos algoritmos polinomiais, tem recebido muita atenção desd

APA, Harvard, Vancouver, ISO, and other styles

35

Irniger, Christophe-André. "Graph matching filtering databases of graphs using machine learning techniques." Berlin Aka, 2005. http://deposit.ddb.de/cgi-bin/dokserv?id=2677754&prov=M&dok_var=1&dok_ext=htm.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Zavalina, Viktoriia. "Identifikace objektů v obraze." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220364.

Full text

Abstract:

Master´s thesis deals with methods of objects detection in the image. It contains theoretical, practical and experimental parts. Theoretical part describes image representation, the preprocessing image methods, and methods of detection and identification of objects. The practical part contains a description of the created programs and algorithms which were used in the programs. Application was created in MATLAB. The application offers intuitive graphical user interface and three different methods for the detection and identification of objects in an image. The experimental part contains a test

APA, Harvard, Vancouver, ISO, and other styles

37

Olšarová, Nela. "Inference propojení komponent." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236505.

Full text

Abstract:

The Master Thesis deals with the design of hardware component interconnection inference algorithm that is supposed to be used in the FPGA schema editor that was integrated into educational integrated development environment VLAM IDE. The aim of the algorithm is to support user by finding an optimal interconnection of two given components. The editor and the development environment are implemented as an Eclipse plugin using GMF framework. A brief description of this technologies and the embedded systems design are followed by the design of the inference algorithm. This problem is a topic of com

APA, Harvard, Vancouver, ISO, and other styles

38

Jančová, Markéta. "Generická analýza toků v počítačových sítích." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417290.

Full text

Abstract:

Tato práce se zabývá problematikou popisu síťového provozu pomocí automaticky vytvořeného modelu komunikace. Hlavním zaměřením jsou komunikace v řídicích systémech , které využívají speciální protokoly, jako je například IEC 60870-5-104 . V této práci představujeme metodu charakteristiky síťového provozu z pohledu obsahu komunikace i chování v čase. Tato metoda k popisu využívá deterministické konečné automaty , prefixové stromy a analýzu opakovatelnosti. Ve druhé části této diplomové práce se zaměřujeme na implementaci programu, který je schopný na základě takového modelu komunikace verifiko

APA, Harvard, Vancouver, ISO, and other styles

39

Rebai, Salma. "Resource allocation in Cloud federation." Thesis, Evry, Institut national des télécommunications, 2017. http://www.theses.fr/2017TELE0006/document.

Full text

Abstract:

L'informatique en nuage (Cloud Computing) est un modèle à grande échelle et en évolution continue, permettant le provisionnement et l'utilisation des ressources informatiques à la demande, selon un modèle rentable de facturation à l'usage "pay-as-you-go". Ce nouveau paradigme a rapidement révolutionné l'industrie IT et a permis de nouvelles tendances en matière de prestation de services informatiques, y compris l'externalisation des infrastructures IT vers des prestataires tiers spécialisés. Cependant, la nature multi-utilisateur des plateformes d'hébergement, ainsi que la complexité des deman

APA, Harvard, Vancouver, ISO, and other styles

40

Silver, Ian. "Genetically Adjusted Propensity Score Matching: A Proposal of a Novel Analytical Tool to Help Close the Gap between Non-experimental Designs and True Experiments in the Social Sciences." University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1561996445863208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bergman, John. "Efficient fuzzy type-ahead search on big data using a ranked trie data structure." Thesis, Umeå universitet, Institutionen för fysik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-145029.

Full text

Abstract:

The efficiency of modern search engines depends on how well they present typo-corrected results to a user while typing. So-called fuzzy type-ahead search combines fuzzy string matching and search-as-you-type functionality, and creates a powerful tool for exploring indexed data. Current fuzzy type-ahead search algorithms work well on small data sets, but for big data of social networking services such as Facebook, e-commerce sites such as Amazon, or media streaming services such as YouTube, responsive fuzzy type-ahead search remains a great challenge. This thesis describes a method that enables

APA, Harvard, Vancouver, ISO, and other styles

42

Rebai, Salma. "Resource allocation in Cloud federation." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2017. http://www.theses.fr/2017TELE0006.

Full text

Abstract:

L'informatique en nuage (Cloud Computing) est un modèle à grande échelle et en évolution continue, permettant le provisionnement et l'utilisation des ressources informatiques à la demande, selon un modèle rentable de facturation à l'usage "pay-as-you-go". Ce nouveau paradigme a rapidement révolutionné l'industrie IT et a permis de nouvelles tendances en matière de prestation de services informatiques, y compris l'externalisation des infrastructures IT vers des prestataires tiers spécialisés. Cependant, la nature multi-utilisateur des plateformes d'hébergement, ainsi que la complexité des deman

APA, Harvard, Vancouver, ISO, and other styles

43

SILVA, Israel Batista Freitas da. "Representações cache eficientes para índices baseados em Wavelet trees." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/21050.

Full text

Abstract:

Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2017-08-30T19:22:34Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Israel Batista Freitas da Silva.pdf: 1433243 bytes, checksum: 5b1ac5501cae385e4811343e1426e6c9 (MD5)<br>Made available in DSpace on 2017-08-30T19:22:34Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Israel Batista Freitas da Silva.pdf: 1433243 bytes, checksum: 5b1ac5501cae385e4811343e1426e6c9 (MD5) Previous issue date: 2016-12-12<br>CNPQ, FACEPE.<br>Hoje em d

APA, Harvard, Vancouver, ISO, and other styles

44

Curado, Manuel. "Structural Similarity: Applications to Object Recognition and Clustering." Doctoral thesis, Universidad de Alicante, 2018. http://hdl.handle.net/10045/98110.

Full text

Abstract:

In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node similarity, we focus on improving the diffusive process leading to compute this similarity (e.g. Commute Times) by means of modifying or rewiring the structure of the graph (Graph Densification), although some advances in Laplacian-based ranking are also included in this document. Graph Densification is a particular case of what we call graph rewiring, i.e. a novel field (similar to image processing) where input graphs are

APA, Harvard, Vancouver, ISO, and other styles

45

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2003. http://hdl.handle.net/11572/311140.

Full text

Abstract:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decad

APA, Harvard, Vancouver, ISO, and other styles

46

Hultin, Felix. "Phonotactic Structures in Swedish : A Data-Driven Approach." Thesis, Stockholms universitet, Institutionen för lingvistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144259.

Full text

Abstract:

Ever since Bengt Sigurd laid out the first comprehensive description of Swedish phonotactics in 1965, it has been the main point of reference within the field. This thesis attempts a new approach, by presenting a computational and statistical model of Swedish phonotactics, which can be built by any corpus of IPA phonetic script. The model is a weighted trie, represented as a finite state automaton, where states are phonemes linked by transitions in valid phoneme sequences, which adds the benefits of being probabilistic and expressible by regular languages. It was implemented using the Nordisk

APA, Harvard, Vancouver, ISO, and other styles

47

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Full text

Abstract:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science,biology, and many others. In the last decad

APA, Harvard, Vancouver, ISO, and other styles

48

Cervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Full text

Abstract:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decad

APA, Harvard, Vancouver, ISO, and other styles

49

Toth, Róbert. "Přibližné vyhledávání řetězců v předzpracovaných dokumentech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236122.

Full text

Abstract:

This thesis deals with the problem of approximate string matching, also called string matching allowing errors. The thesis targets the area of offline algorithms, which allows very fast pattern matching thanks to index created during initial text preprocessing phase. Initially, we will define the problem itself and demonstrate variety of its applications, followed by short survey of different approaches to cope with this problem. Several existing algorithms based on suffix trees will be explained in detail and new hybrid algorithm will be proposed. Algorithms wil be implemented in C programmin

APA, Harvard, Vancouver, ISO, and other styles

50

Yahiaoui, Said. "Algorithmes et applications pour la coloration et les alliances dans les graphes." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10274.

Full text

Abstract:

Dans cette thèse, nous nous intéressons aux aspects algorithmiques et applications de deux problèmes de graphes, à savoir, la coloration et les alliances. La première partie concerne deux variantes de la coloration de graphes, la coloration Grundy et la coloration forte stricte. Nous commençons par l'étude du nombre Grundy des graphes réguliers. Nous donnons une condition fixe k, nous fournissons une condition nécessaire et suffisante pour que le nombre Grundy d'un graphe régulier soit au moins égal k. Nous caractérisons la classe des graphes cubiques (3-réguliers) pour laquelle le nombre Grun

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!