Results 131 to 140 of about 32,468 (150)
Some of the next articles are maybe not open access.
A graph Fourier transform and proportional graphs
Random Structures & Algorithms, 1995AbstractA Fourier transform for (real valued) functions of graphs is denned. This is used to study and characterize some classes of graphs that arise as exceptional cases in limit theorems for subgraph counts in random graphs.
openaire +1 more source
The windowed two-dimensional graph fractional Fourier transform
Digital Signal ProcessingBing-Zhao Li
exaly +2 more sources
A parallel algorithm for computing Fourier transforms on the star graph
IEEE Transactions on Parallel and Distributed Systems, 1994The n-star graph, denoted by S/sub n/, is one of the graph networks that have been recently proposed as attractive alternatives to the n-cube topology for interconnecting processors in parallel computers. We present a parallel algorithm for the computation of the Fourier transform on the star graph. The algorithm requires O(n/sup 2/) multiply-add steps
Paraskevi Fragopoulou, Selim G. Akl
openaire +1 more source
A new windowed graph Fourier transform
2017 4th NAFOSTED Conference on Information and Computer Science, 2017Many practical networks can be mathematically modeled as graphs. Graph signal processing (GSP), intersecting graph theory and computational harmonic analysis, can be used to analyze graph signals. Just as short-time Fourier transform (STFT) for time-frequency analysis in classical signal processing, we have windowed graph Fourier transform (WGFT) for ...
Le Trung Thanh +3 more
openaire +1 more source
Fourier Transform vs. Graph Fourier Transform for EEG-Based Emotion Recognition
2020Electroencephalogram (EEG)-based feature extraction for emotion recognition is a very challenging task. The vast majority of the feature extraction approaches are based on the frequency characteristics of the EEG signals which are extracted using, e.g., the traditional Fourier Transform approach.
Panagiotis C. Petrantonakis +2 more
openaire +1 more source
Slides: Graph Fourier Transform for Directed Graphs
Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and effectively represent graph signals with strong correlations using various modes of variation.openaire +1 more source
Fourier transformations of hypergraphs and graphs
Cybernetics, 1981Bandman, O. L., Markova, V. P.
openaire +2 more sources
Graph Fourier transform based on singular value decomposition of the directed Laplacian
Sampling Theory, Signal Processing, and Data Analysis, 2023Qiyu Sun, Sun Qiyu
exaly
Graph Fourier Transforms on Signed Graphs
Proceedings of the 2024 12th International Conference on Communications and Broadband NetworkingYang Chen 0047 +3 more
openaire +1 more source