Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Graph Labelling"”.

  1. Extremal problems for labelling of graphs and distance in digraphs

    We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter 2 we apply the Discharging Method to prove the 1,2,3-Conjecture [41] and the 1,2-Conjecture [48] for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been …

    uiuc Repository record for Extremal problems for labelling of graphs and distance in digraphs (opens in a new tab)

  2. Activity-driven detection of cognitive impairment using deep learning.

    … problem is emulated (i) as a sequence labelling problem to model spatio-temporal patterns. (ii) as a hierarchical learning problem to model sub-activities. (iii) as a graph labelling problem to encode granular level details. Thirdly, raw sensor measurements stemming from sequential data …

    bournemouth Repository record for Activity-driven detection of cognitive impairment using deep learning. (opens in a new tab)