Results 21 to 30 of about 21,926 (256)
Directional graph weight prediction for image compression [PDF]
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017 Graph-based models have recently attracted attention for their potential to enhance transform coding image compression thanks to their capability to efficiently represent discontinuities. Graph transform gets closer to the optimal KLT by using weights that represent inter-pixel correlations but the extra cost to provide such weights can overwhelm the ...
Francesco Verdoja, Marco Grangetto
openaire +1 more source
Graph theory applications in congenital heart disease
Scientific Reports, 2023 Graph theory can be used to address problems with complex network structures. Congenital heart diseases (CHDs) involve complex abnormal connections between chambers, vessels, and organs.
Yao-Ting Lee, Shyh-Jye Chen
doaj +1 more source
Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs
Advances in Electrical and Electronic Engineering, 2017 We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system.
Alexander Nikolaevich Tselykh +3 more
doaj +1 more source
Iterative improvement approaches for collecting weighted items in directed bipartite graphs
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2018 In this paper, an iterative improvement heuristic based on the simulated annealing is designed for a weighted item collecting problem in directed bipartite graphs.
Yoshiyuki KARUNO, Seiya TANAKA
doaj +1 more source
Recognizing weighted directed cartesian graph bundles
Discussiones Mathematicae Graph Theory, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zmazek, Blaž, Žerovnik, Janez
openaire +4 more sources
Regularity-based spectral clustering and mapping the Fiedler-carpet
Special Matrices, 2022 We discuss spectral clustering from a variety of perspectives that include extending techniques to rectangular arrays, considering the problem of discrepancy minimization, and applying the methods to directed graphs. Near-optimal clusters can be obtained
Bolla Marianna +4 more
doaj +1 more source
Systems, 2023 We introduce resource allocation techniques for problems where (i) the agents express requests for obtaining item bundles as compact edge-weighted directed acyclic graphs (each path in such a graph is a bundle whose valuation is the sum of the weights of
Stéphanie Roussel +3 more
doaj +1 more source
Weight-discounted Symmetrization in Clustering Directed Graphs
Proceedings of the 2012 2nd International Conference on Computer and Information Applications (ICCIA 2012), 2012 An increasing attention has been recently devoted to uncovering community structure in directed graphs which widely exist in real-world complex networks such as social networks, citation networks, World Wide Web, email networks, etc. A two-stage framework for detecting clusters is an effective way for clustering directed graphs while the first stage is
Bin He +3 more
openaire +1 more source
On The Determinant of q-Distance Matrix of a Graph
Discussiones Mathematicae Graph Theory, 2014 In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj +1 more source
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
MathematicsThe category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +1 more source