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 comparison"”.
-
Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection
Learning a suitable graph is an important precursor to many graph signal processing (GSP) tasks, such as graph signal compression and denoising. Previous graph learning algorithms either make assumptions on graph connectivity (e.g., graph sparsity), or make individual edge weight assumptions such …
-
EXPLORING MULTIPLEX NETWORKS
… networks, brain connectivity networks and web graphs are only some of the examples. As network theory evolves it becomes more apparent that these complex systems are often composed of multiple types of interactions, each carrying a different piece of information, and therefore are commonly …