Log in

Relevant bibliographies by topics / Labeled graphs / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Labeled graphs.

Dissertations / Theses on the topic 'Labeled graphs'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

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

Select a source type:

Consult the top 49 dissertations / theses for your research on the topic 'Labeled graphs.'

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

Fan, Shuangfei. "Deep Representation Learning on Labeled Graphs." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/96596.

Full text

Abstract:

We introduce recurrent collective classification (RCC), a variant of ICA analogous to recurrent neural network prediction. RCC accommodates any differentiable local classifier and relational feature functions. We provide gradient-based strategies for optimizing over model parameters to more directly minimize the loss function. In our experiments, this direct loss minimization translates to improved accuracy and robustness on real network data. We demonstrate the robustness of RCC in settings where local classification is very noisy, settings that are particularly challenging for ICA. As a new

APA, Harvard, Vancouver, ISO, and other styles

2

Martinsen, Thor. "Refinement composition using doubly labeled transition graphs." Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion-image.exe/07Sep%5FMartinsen.pdf.

Full text

Abstract:

Thesis (M.S. in Computer Science and M.S. in Applied Mathematics)--Naval Postgraduate School, September 2007.<br>Thesis Advisor(s): Dinolt, George ; Fredricksen, Harold. "September 2007." Description based on title screen as viewed on October 23, 2007. Includes bibliographical references (p.49-51). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

3

Willis, Paulette Nicole. "C*-algebras of labeled graphs and *-commuting endomorphisms." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/627.

Full text

Abstract:

My research lies in the general area of functional analysis. I am particularly interested in C*-algebras and related dynamical systems. From the very beginning of the theory of operator algebras, in the works of Murray and von Neumann dating from the mid 1930's, dynamical systems and operator algebras have led a symbiotic existence. Murray and von Neumann's work grew from a few esoteric, but clearly original and prescient papers, to a ma jor river of contemporary mathematics. My work lies at the confluence of two important tributaries to this river. On the one hand, the operator algebras that

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

Gurajada, Sairam [Verfasser], and Gerhard [Akademischer Betreuer] Weikum. "Distributed querying of large labeled graphs / Sairam Gurajada ; Betreuer: Gerhard Weikum." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2017. http://d-nb.info/1125431903/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Christensen, Robin. "An Analysis of Notions of Differential Privacy for Edge-Labeled Graphs." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-169379.

Full text

Abstract:

The user data in social media platforms is an excellent source of information that is beneficial for both commercial and scientific purposes. However, recent times has seen that the user data is not always used for good, which has led to higher demands on user privacy. With accurate statistical research data being just as important as the privacy of the user data, the relevance of differential privacy has increased. Differential privacy allows user data to be accessible under certain privacy conditions at the cost of accuracy in query results, which is caused by noise. The noise is based on a

APA, Harvard, Vancouver, ISO, and other styles

7

Meng, Jinghan. "Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs." Scholar Commons, 2017. http://scholarcommons.usf.edu/etd/6900.

Full text

Abstract:

In recent years, the popularity of graph databases has grown rapidly. This paper focuses on single-graph as an effective model to represent information and its related graph mining techniques. In frequent pattern mining in a single-graph setting, there are two main problems: support measure and search scheme. In this paper, we propose a novel framework for constructing support measures that brings together existing minimum-image-based and overlap-graph-based support measures. Our framework is built on the concept of occurrence / instance hypergraphs. Based on that, we present two new support m

APA, Harvard, Vancouver, ISO, and other styles

8

Mortada, Maidoun. "The b-chromatic number of regular graphs." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10116.

Full text

Abstract:

Les deux problèmes majeurs considérés dans cette thèse : le b-coloration problème et le graphe emballage problème. 1. Le b-coloration problème : Une coloration des sommets de G s'appelle une b-coloration si chaque classe de couleur contient au moins un sommet qui a un voisin dans toutes les autres classes de couleur. Le nombre b-chromatique b(G) de G est le plus grand entier k pour lequel G a une b-coloration avec k couleurs. EL Sahili et Kouider demandent s'il est vrai que chaque graphe d-régulier G avec le périmètre au moins 5 satisfait b(G) = d + 1. Blidia, Maffray et Zemir ont montré que l

APA, Harvard, Vancouver, ISO, and other styles

9

Ruan, Da. "Statistical methods for comparing labelled graphs." Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/24963.

Full text

Abstract:

Due to the availability of the vast amount of graph-structured data generated in various experiment settings (e.g., biological processes, social connections), the need to rapidly identify network structural differences is becoming increasingly prevalent. In many fields, such as bioinformatics, social network analysis and neuroscience, graphs estimated from the same experimental settings are always defined on a fixed set of objects. We formalize such a problem as a labelled graph comparison problem. The main issue in this area, i.e. measuring the distance between graphs, has been extensively st

APA, Harvard, Vancouver, ISO, and other styles

10

Huynh, Tony. "The Linkage Problem for Group-labelled Graphs." Thesis, University of Waterloo, University of Waterloo, 2009. http://hdl.handle.net/10012/4716.

Full text

Abstract:

This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled from $\Gamma$, and is thus a generalization of a signed graph. Our primary result is a generalization of the main result from Graph Minors XIII. For any finite abelian group $\Gamma$, and any fixed $\Gamma$-labelled graph $H$, we present a polynomial-time algorithm that determines if an input $\Gamma$-labelled graph $G$ has an $H$-minor. The correctness of our algorit

APA, Harvard, Vancouver, ISO, and other styles

11

Park, Noseong. "Top-K Query Processing in Edge-Labeled Graph Data." Thesis, University of Maryland, College Park, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10128677.

Full text

Abstract:

<p> Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are represented by edges and each edge is labeled with a semantic annotation. Hence, a huge single graph can express many different relationships between entities. The Semantic Web represents each single fragment of knowledge as a triple (subject, predicate, object), which is conceptually identical to an edge from subject to object labeled with predicates. A set of triples constitutes an edge-labeled gra

APA, Harvard, Vancouver, ISO, and other styles

12

Li, Jie. "Data integration for biological network databases MetNetDB labeled graph model and graph matching algorithm /." [Ames, Iowa : Iowa State University], 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Attal, Jean-Philippe. "Nouveaux algorithmes pour la détection de communautés disjointes et chevauchantes basés sur la propagation de labels et adaptés aux grands graphes." Thesis, Cergy-Pontoise, 2017. http://www.theses.fr/2017CERG0842/document.

Full text

Abstract:

Les graphes sont des structures mathématiques capable de modéliser certains systèmes complexes.Une des nombreuses problématiques liée aux graphes concerne la détection de communautés qui vise à trouver une partition en sommet d'un graphe en vue d'en comprendre la structure. A titre d'exemple, en représentant des contratsd'assurances par des noeuds et leurs degrés de similarité par une arête,détecter des groupes de noeuds fortement connectésconduit à détecter des profils similaires, et donc a voir des profils à risques.De nombreux algorithmes ont essayé de répondreà ce problème.Une des méthodes

APA, Harvard, Vancouver, ISO, and other styles

14

Humphries, Peter John. "Combinatorial Aspects of Leaf-Labelled Trees." Thesis, University of Canterbury. Mathematics and Statistics, 2008. http://hdl.handle.net/10092/1801.

Full text

Abstract:

Leaf-labelled trees are used commonly in computational biology and in other disciplines, to depict the ancestral relationships and present-day similarities between both extant and extinct species. Studying these trees from a mathematical perspective provides a foundation for developing tools and techniques that have practical applications. We begin by examining some quartet problems, namely determining the number of quartets that are required to infer the structure of a particular supertree. The quartet graph is introduced as a tool for tackling quartet problems, and is subsequently used to g

APA, Harvard, Vancouver, ISO, and other styles

15

Johansson, Öjvind. "Graph Decomposition Using Node Labels." Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3213.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Planche, Léo. "Décomposition de graphes en plus courts chemins et en cycles de faible excentricité." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCB224.

Full text

Abstract:

En collaboration avec des chercheurs en biologie à Jussieu, nous étudions des graphes issus de données biologiques afin de d'en améliorer la compréhension. Ces graphes sont constitués à partir de fragments d'ADN, nommés reads. Chaque read correspond à un sommet, et deux sommets sont reliés si les deux séquences d'ADN correspondantes ont un taux de similarité suffisant. Ainsi se forme des graphes ayant une structure bien particulière que nous nommons hub-laminaire. Un graphe est dit hub-laminaire s'il peut être résumé en quelques plus courts chemins dont tous les sommets du graphe soient proche

APA, Harvard, Vancouver, ISO, and other styles

17

HONG, HUI. "Computing Label-Constraint Reachability in Graph Databases." Kent State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=kent1333472725.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chatel, David. "Semi-supervised clustering in graphs." Thesis, Lille 1, 2017. http://www.theses.fr/2017LIL10134/document.

Full text

Abstract:

Le partitionnement consiste à rechercher une partition d'éléments, de sorte que les éléments d'un même cluster soient plus similaires que les éléments de différents clusters. Les données proviennent de différentes sources et prennent des formes différentes. L'un des défis consiste à concevoir un système capable de tirer parti des différentes sources de données. Certaines contraintes peuvent être connues sur les données. On peut savoir qu'un objet est d'un certain type ou que deux objets partagent le même type ou sont de types différents. On peut également savoir qu'à l'échelle globale, les dif

APA, Harvard, Vancouver, ISO, and other styles

19

Shafie, Termeh. "Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference." Doctoral thesis, Stockholms universitet, Statistiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82697.

Full text

Abstract:

This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered. The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. The second model is obtained by independent edge assignments (IEA) according to a common probability distribution over the edge sites. Two different methods for obtaining an approximate IEA model from an RSM model are also presented. In Paper I, multigraphs

APA, Harvard, Vancouver, ISO, and other styles

20

Lawergren, Filip, and Robin Thunholm. "Etikettdesign och prisklass för röda viner." Thesis, Högskolan Dalarna, Grafisk teknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:du-20763.

Full text

Abstract:

Denna studie syftar till att undersöka om det finns ett samband mellan designfaktorer och prisklass på rödvinsetiketter. För att kartlägga förekommande designfaktorer har en visuell innehållsanalys gjorts inom tre olika prisklasser hämtad från Systembolagets hemsida. Utifrån den visuella innehållsanalysens resultat designades tre vinetiketter för varje prisklass. För att ta reda på om dessa designfaktorer hade ett samband med den tänkta prisklassen testades vinetiketterna mot konsumenter genom en webbenkät. Slutsatsen var att det fanns vissa generella drag som skiljer prisklasserna åt även om

APA, Harvard, Vancouver, ISO, and other styles

21

Mote, Kevin Dean. "Fast point-feature label placement for dynamic visualizations." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Fall2007/k_mote_111307.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Adamský, Aleš. "Segmentace mluvčích s využitím statistických metod klasifikace." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219007.

Full text

Abstract:

The thesis discusses in detail some concepts of speech and prosody that can contribute to build a speech corpus for the speaker segmentation purpose. Moreover, the Elan multimedia annotator used for labeling is described. The theoretical part highlights some frequently used speech features such as MFCC, PLP and LPC and deals with currently most popular speech segmentation methods. Some classification algorithms are also mentioned. The practical part describes implementation of Bayesian information criterium algorithm in system for automatic speaker segmentation. For classification of speaker c

APA, Harvard, Vancouver, ISO, and other styles

23

King, Larrie Leon Jr. "Private Labels and Personal Care: A Focus on Store Brand Package Design, Branding Design and Consumer Attitudes Towards Private Label Personal Care Products." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1400330956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Okoth, Isaac Owino. "Combinatorics of oriented trees and tree-like structures." Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96860.

Full text

Abstract:

Thesis (PhD)--Stellenbosch University, 2015.<br>ENGLISH ABSTRACT : In this thesis, a number of combinatorial objects are enumerated. Du and Yin as well as Shin and Zeng (by a different approach) proved an elegant formula for the number of labelled trees with respect to a given in degree sequence, where each edge is oriented from a vertex of lower label towards a vertex of higher label. We refine their result to also take the number of sources (vertices of in degree 0) or sinks (vertices of out degree 0) into account. We find formulas for the mean and variance of the number of sinks or s

APA, Harvard, Vancouver, ISO, and other styles

25

Alise, Dario Fioravante. "Algoritmo di "Label Propagation" per il clustering di documenti testuali." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14388/.

Full text

Abstract:

Negli ultimi anni del secolo scorso l’avvento di Internet ha permesso di avere a disposizione innumerevoli quantità di testi consultabili online, provenienti sia da libri e riviste, sia da nuove forme di comunicazione della rete quali email, forum, newsgroup e chat.  Le soluzioni adottate nel settore del Text Mining (d’ora in poi abbreviato in TM), che è l’estensione del Data Mining rivolto a dati testuali non strutturati, si basano su fondamenti informatici, statistici e linguistici e sono in linea di principio applicabili a documenti di qualsiasi dimensione. Con l’avvento dei Social Networks

APA, Harvard, Vancouver, ISO, and other styles

26

Faustino, Ana Rita de Figueiredo Teixeira. "Design de comunicação como estágio curricular na empresa Label Brand Studio." Master's thesis, Universidade de Lisboa. Faculdade de Arquitetura, 2014. http://hdl.handle.net/10400.5/8105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Gregersen, Petra. "Etikettdesign som förmedlar smak." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139009.

Full text

Abstract:

Följande studie syftar till att undersöka hur en rödvinsflaskas etikett kan designas för att attrahera målgruppen millennials och samtidigt förmedla vinets smak. För att göra detta gjordes en undersökning av målgruppens preferenser genom en kvantitativ inledande studie, följt av en förstudie som undersökte tidigare studier och även designteori. I designprocessen användes den insamlade informationen från den inledande studien och förstudien för att ta designbeslut. Tre etikettalternativ togs fram som sedan validerades med målgruppen i form av en fokusgrupp. Fokusgruppen innefattade delar med kv

APA, Harvard, Vancouver, ISO, and other styles

28

Jönsson, Mattias, and Lucas Borg. "How to explain graph-based semi-supervised learning for non-mathematicians?" Thesis, Malmö universitet, Fakulteten för teknik och samhälle (TS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20339.

Full text

Abstract:

Den stora mängden tillgänglig data på internet kan användas för att förbättra förutsägelser genom maskininlärning. Problemet är att sådan data ofta är i ett obehandlat format och kräver att någon manuellt bestämmer etiketter på den insamlade datan innan den kan användas av algoritmen. Semi-supervised learning (SSL) är en teknik där algoritmen använder ett fåtal förbehandlade exempel och därefter automatiskt bestämmer etiketter för resterande data. Ett tillvägagångssätt inom SSL är att representera datan i en graf, vilket kallas för graf-baserad semi-supervised learning (GSSL), och sedan hitta

APA, Harvard, Vancouver, ISO, and other styles

29

Gouveia, da silva Thiago. "The Minimum Labeling Spanning Tree and Related Problems." Thesis, Avignon, 2018. http://www.theses.fr/2018AVIG0278.

Full text

Abstract:

Soit L un ensemble fini d’éléments appelés étiquettes. On appelle graphe étiqueté simple, un graphe simple dans lequel à chaque arête est associée une étiquette prise dans L. Le problème de l’arbre couvrant de nombre d’étiquettes minimal (en anglais: the minimum labeling spanning tree problem, MLSTP) est un problème d’optimisation combinatoire consistant à trouver un arbre couvrant dans un graphe étiqueté simple en utilisant un nombre minimum d’étiquettes. Le problème est NP-dur. Il a fait l’objet d’un nombre important de recherche au cours des dernières années. L’une de ces directions de rech

APA, Harvard, Vancouver, ISO, and other styles

30

Dogbey, James K. "Concepts of Variable in Middle-Grades Mathematics Textbooks during Four Eras of Mathematics Education in the United States." Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1615.

Full text

Abstract:

This study used content analysis to investigate the development of the concept of variables in middle grades mathematics textbooks during four eras of mathematics education in the United States (New Math, Back to Basics, Problem Solving, and the NCTM Standards era: 1957 – 2009). It also examined the nature of support that the curricula provide for teachers to enact variables ideas in the classroom. Findings revealed that each of the middle grades mathematics curricula examined used variables, but in varied proportions and levels of complexity. Formal definitions for variables were found in 11

APA, Harvard, Vancouver, ISO, and other styles

31

Dash, Santanu Kumar. "Adaptive constraint solving for information flow analysis." Thesis, University of Hertfordshire, 2015. http://hdl.handle.net/2299/16354.

Full text

Abstract:

In program analysis, unknown properties for terms are typically represented symbolically as variables. Bound constraints on these variables can then specify multiple optimisation goals for computer programs and nd application in areas such as type theory, security, alias analysis and resource reasoning. Resolution of bound constraints is a problem steeped in graph theory; interdependencies between the variables is represented as a constraint graph. Additionally, constants are introduced into the system as concrete bounds over these variables and constants themselves are ordered over a lattice

APA, Harvard, Vancouver, ISO, and other styles

32

Torres, Guilherme Mundim. "Engenharia de tráfego para obtenção de QoS na comunicação entre tarefas em grades computacionais." Universidade Federal de São Carlos, 2006. https://repositorio.ufscar.br/handle/ufscar/364.

Full text

Abstract:

Made available in DSpace on 2016-06-02T19:05:27Z (GMT). No. of bitstreams: 1 1680.pdf: 2540055 bytes, checksum: 6068982fae71ad51efe5f0ebb3308784 (MD5) Previous issue date: 2006-12-15<br>The advent of grid computing made possible to access distributed resources, even when they are geographically spread or belong to different organizations. The most used environment for accessing these distributed resources is the Internet, a worldwide computer network based in TCP/IP architecture. Grid computing provides the infrastructure necessary for managing and communicating with the resources offered by

APA, Harvard, Vancouver, ISO, and other styles

33

Jia, Wei. "Image analysis and representation for textile design classification." Thesis, University of Dundee, 2011. https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266.

Full text

Abstract:

A good image representation is vital for image comparision and classification; it may affect the classification accuracy and efficiency. The purpose of this thesis was to explore novel and appropriate image representations. Another aim was to investigate these representations for image classification. Finally, novel features were examined for improving image classification accuracy. Images of interest to this thesis were textile design images. The motivation of analysing textile design images is to help designers browse images, fuel their creativity, and improve their design efficiency. In rec

APA, Harvard, Vancouver, ISO, and other styles

34

Zajaczkowski, Erica Lea. "Information, Design, and Technology:How They Work Together to Inform a Museum Visitor." University of Akron / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=akron1407780595.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Lemaître, Mathieu. "Ressources patrimoniales culturelles et développement touristique." Thesis, Toulouse 2, 2015. http://www.theses.fr/2015TOU20036/document.

Full text

Abstract:

Cette thèse étudie les mécanismes qui déterminent le succès des stratégies de développement touristique centrées sur le patrimoine culturel. La première partie revient sur la notion de patrimoine et les enjeux économiques liés à sa valorisation. Elle tente notamment d’identifier les liens entre la nature des ressources et leur place sur le marché. La seconde partie cherche à construire un cadre théorique apte à appréhender le caractère spécifique du patrimoine. Elle envisage son rôle sous l’angle des avantages absolus et différenciatifs, et s’intéresse à son processus d’activation. La troisièm

APA, Harvard, Vancouver, ISO, and other styles

36

Huang, Sangxia. "Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness." Doctoral thesis, KTH, Teoretisk datalogi, TCS, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168576.

Full text

Abstract:

A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. This landmark theorem, and the works leading up to it, laid the foundation for many subsequent works in computational complexity theory, the most prominent among them being the study of inapproximability of combinatorial optimization proble

APA, Harvard, Vancouver, ISO, and other styles

37

Phillips, Katelynn. "Breaking Through Panels: Examining Growth and Trauma in Bechdel's Fun Home and Labelle's Assigned Male Comics." Bowling Green State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1530891026381072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Pootheri, Sridar Kuttan. "Counting classes of labeled 2-connected graphs." 2000. http://purl.galileo.usg.edu/uga%5Fetd/pootheri%5Fsridar%5Fk%5F200005%5Fms.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Araújo, Miguel Ramos de. "Communities and Anomaly Detection in Large Edged-Labeled Graphs." Tese, 2017. https://hdl.handle.net/10216/105062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Araújo, Miguel Ramos de. "Communities and Anomaly Detection in Large Edged-Labeled Graphs." Doctoral thesis, 2017. https://hdl.handle.net/10216/105062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Huang, Jiayuan. "Learning from Partially Labeled Data: Unsupervised and Semi-supervised Learning on Graphs and Learning with Distribution Shifting." Thesis, 2007. http://hdl.handle.net/10012/3165.

Full text

Abstract:

This thesis focuses on two fundamental machine learning problems:unsupervised learning, where no label information is available, and semi-supervised learning, where a small amount of labels are given in addition to unlabeled data. These problems arise in many real word applications, such as Web analysis and bioinformatics,where a large amount of data is available, but no or only a small amount of labeled data exists. Obtaining classification labels in these domains is usually quite difficult because it involves either manual labeling or physical experimentation. This thesis approaches these pr

APA, Harvard, Vancouver, ISO, and other styles

42

Chu, Sheng-Chih, and 朱聖池. "Efficiently Finding Neighborhood Patterns in a Large Labeled Graph." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/10254639751782455142.

Full text

Abstract:

碩士<br>國立臺灣師範大學<br>資訊工程學系<br>103<br>Graph is a powerful abstraction of structural data, which is applied to model the various relations among data in a real world. Recently, a new kind of patterns called frequent neighborhood patterns is defined for a large labeled graph. Frequent neighborhood patterns have the downward closure property of the support measure and provide meaningful interpretations of pattern mining. The previous work used an Apriori-like approach to combine the discovered frequent neighborhood patterns into larger candidate patterns, many of the generated candidates may not app

APA, Harvard, Vancouver, ISO, and other styles

43

Morgan, David. "Gracefully labelled trees from Skolem and related sequences /." 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Dickinson, Peter. "Graph based techniques for measurement of intranet dynamics." 2006. http://arrow.unisa.edu.au:8081/1959.8/45980.

Full text

Abstract:

This thesis develops a number of graph-based techniques that are capable of measuring the dynamic behaviour of a network and discusses their application in network management. By representing a computer network as a time series of uniquely labelled graphs, it is possible to measure the degree of change that has occurred between a pair of graphs, and hence the dynamics in a network. Concepts introduced include the median graph, intra- and inter- graph clustering, and hierarchical graph representations. The focus is on producing efficient algorithms and improved measures of network change. It is

APA, Harvard, Vancouver, ISO, and other styles

45

"Graph-based recommendation with label propagation." 2011. http://library.cuhk.edu.hk/record=b5894820.

Full text

Abstract:

Wang, Dingyan.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.<br>Includes bibliographical references (p. 97-110).<br>Abstracts in English and Chinese.<br>Abstract --- p.ii<br>Acknowledgement --- p.vi<br>Chapter 1 --- Introduction --- p.1<br>Chapter 1.1 --- Overview --- p.1<br>Chapter 1.2 --- Motivations --- p.6<br>Chapter 1.3 --- Contributions --- p.9<br>Chapter 1.4 --- Organizations of This Thesis --- p.11<br>Chapter 2 --- Background --- p.14<br>Chapter 2.1 --- Label Propagation Learning Framework --- p.14<br>Chapter 2.1.1 --- Graph-based Semi-supervised Learning --- p.

APA, Harvard, Vancouver, ISO, and other styles

46

Wang, Chung Han, and 王宗涵. "Unsupervised Image Segmentation using Multi-label Graph Cuts." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/92616521540163396109.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>104<br>Image segmentation is an important issue in image editing and computer vision. Due to the complexity of information in images, efficient extraction of a foreground object is a challenging problem. Recently, several approaches based on optimization by graph cuts have been developed which successfully combine the color feature with the edge information. A problem is that the segmentation results heavily depend on the seeds selection. However, it is difficult to obtaining reliable seeds automatically. To overcome this problem, we propose an automatic scheme for im

APA, Harvard, Vancouver, ISO, and other styles

47

Tedder, Marc. "Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs." Thesis, 2011. http://hdl.handle.net/1807/29888.

Full text

Abstract:

This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition al

APA, Harvard, Vancouver, ISO, and other styles

48

Humphries, Peter J. "Combinatorial aspects of leaf-labelled trees : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, University of Canterbury Department of Mathematics and Statistics /." 2008. http://hdl.handle.net/10092/1801.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Shenkenfelder, Warren. "Learning bisimulation." Thesis, 2008. http://hdl.handle.net/1828/1262.

Full text

Abstract:

Computational learning theory is a branch of theoretical computer science that re-imagines the role of an algorithm from an agent of computation to an agent of learning. The operations of computers become those of the human mind; an important step towards illuminating the limitations of artificial intelligence. The central difference between a learning algorithm and a traditional algorithm is that the learner has access to an oracle who, in constant time, can answer queries about that to be learned. Normally an algorithm would have to discover such information on its own accord. This subtl

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!