Searched for: subject%3A%22graph%22
(401 - 420 of 553)

Pages

document
Di Lorenzo, Paolo (author), Banelli, Paolo (author), Isufi, E. (author), Barbarossa, Sergio (author), Leus, G.J.T. (author)
The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly) time-varying subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely, the least mean squares (LMS) and the recursive least squares (RLS)...
journal article 2018
document
Liu, J. (author), Isufi, E. (author), Leus, G.J.T. (author)
In the field of signal processing on graphs, graph filters play a crucial role in processing the spectrum of graph signals. This paper proposes two different strategies for designing autoregressive moving average (ARMA) graph filters on both directed and undirected graphs. The first approach is inspired by Prony's method, which...
journal article 2018
document
Díaz-Vilarino, L. (author), González-De Santos, L. (author), Verbree, E. (author), Michailidou, G. (author), Zlatanova, S. (author)
Visibility is a common measure to describe the spatial properties of an environment related to the spatial behaviour. Isovists represent the space that can be seen from one observation point, and they are used to analyse the existence of obstacles affecting or blocking intervisibility in an area. Although point clouds depict the as-built...
journal article 2018
document
van Iersel, L.J.J. (author), Moulton, V.L. (author)
An important problem in evolutionary biology is to reconstruct the evolutionary history of a set X of species. This history is often represented as a phylogenetic network, that is, a connected graph with leaves labelled by elements in X (for example, an evolutionary tree), which is usually also binary, i.e., all vertices have degree 1 or 3. A...
journal article 2018
document
Tyuryukanov, I. (author), Naglic, M. (author), Popov, M. (author), van der Meijden, M.A.M.M. (author)
Intentional controlled islanding is a novel emergency control technique to mitigate wide-area instabilities by intelligently separating the power network into a set of self-sustainable islands. During the last decades, it has gained an increased attention due to the recent severe blackouts all over the world. Moreover, the increasing...
book chapter 2018
document
Coutino, Mario (author), Isufi, E. (author), Leus, G.J.T. (author)
The main challenges distributed graph filters face in practice are the communication overhead and computational complexity. In this work, we extend the state-of-the-art distributed finite impulse response (FIR) graph filters to an edge-variant (EV) version, i.e., a filter where every node weights the signals from its neighbors with different...
conference paper 2018
document
Meijer, D.H. (author), van Bijnen, J.A.C. (author), Langeveld, J.G. (author), Korving, J.L. (author), Post, J.A.B. (author), Clemens, F.H.L.R. (author)
Underground water infrastructure is essential for life in cities. The aging of these infrastructures requires maintenance strategies to maintain a minimum service level. Not all elements are equally important for the functioning of the infrastructure as a whole. Identifying the most critical elements in a network is crucial for formulating...
journal article 2018
document
Huang, Yiran (author), Zhong, Cheng (author), Lin, H.X. (author), Wang, Jianyi (author), Peng, Yuzhong (author)
Comparison of metabolic pathways provides a systematic way for understanding the evolutionary and phylogenetic relationships in systems biology. Although a number of phylogenetic methods have been developed, few efforts have been made to provide a unified phylogenetic framework that sufficiently reflects the metabolic features of organisms....
journal article 2018
document
Isufi, E. (author), Mahabir, Ashvant S.U. (author), Leus, G.J.T. (author)
This letter investigates methods to detect graph topological changes without making any assumption on the nature of the change itself. To accomplish this, we merge recently developed tools in graph signal processing with matched subspace detection theory and propose two blind topology change detectors. The first detector exploits the prior...
journal article 2018
document
Uta, Alexandru (author), Au, S.T. (author), Ilyushkin, A.S. (author), Iosup, A. (author)
Graphs are a natural fit for modeling concepts used in solving diverse problems in science, commerce, engineering, and governance. Responding to the diversity of graph data and algorithms, many parallel and distributed graph-processing systems exist. However, until now these platforms use a static model of deployment: they only run on a pre...
conference paper 2018
document
Sun, Zhu (author), Yang, J. (author), Zhang, J. (author), Bozzon, A. (author), Huang, Long Kai (author), Xu, Chi (author)
Knowledge graphs (KGs) have proven to be effective to improve recommendation. Existing methods mainly rely on hand-engineered features from KGs (e.g., meta paths), which requires domain knowledge. This paper presents RKGE, a KG embedding approach that automatically learns semantic representations of both entities and paths between entities...
conference paper 2018
document
Uta, Alexandru (author), Varbanescu, A.L. (author), Musaafir, Ahmed (author), Lemaire, Chris (author), Iosup, A. (author)
The question 'Can big data and HPC infrastructure converge?' has important implications for many operators and clients of modern computing. However, answering it is challenging. The hardware is currently different, and fast evolving: big data uses machines with modest numbers of fat cores per socket, large caches, and much memory, whereas HPC...
conference paper 2018
document
Coutino, Mario (author), Chepuri, S.P. (author), Leus, G.J.T. (author)
In this work, we address the problem of identifying the underlying network structure of data. Different from other approaches, which are mainly based on convex relaxations of an integer problem, here we take a distinct route relying on algebraic properties of a matrix representation of the network. By describing what we call possible...
conference paper 2018
document
Tyuryukanov, I. (author), Popov, M. (author), van der Meijden, M.A.M.M. (author), Terzija, Vladimir (author)
An increasing number of methods for control and analysis of power systems relies on representing power networks as weighted undirected graphs. Unfortunately, the presence of outliers in power system graphs may have a negative impact on many of these methods. In addition, detecting outliers can be a relevant task on its own. Motivated by the...
conference paper 2018
document
Segarra, Santiago (author), Chepuri, S.P. (author), Marques, Antonio G. (author), Leus, G.J.T. (author)
Stationarity is a cornerstone property that facilitates the analysis and processing of random signals in the time domain. Although time-varying signals are abundant in nature, in many contemporary applications the information of interest resides in more irregular domains that can be conveniently represented using a graph. This chapter reviews...
book chapter 2018
document
Isufi, E. (author), Di Lorenzo, Paolo (author), Banelli, Paolo (author), Leus, G.J.T. (author)
This paper proposes strategies for distributed Wiener-based reconstruction of graph signals from subsampled measurements. Given a stationary signal on a graph, we fit a distributed autoregressive moving average graph filter to a Wiener graph frequency response and propose two reconstruction strategies: i) reconstruction from a single temporal...
conference paper 2018
document
Ren, S. (author), Ahmed, N. (author), Bertels, K.L.M. (author), Al-Ars, Z. (author)
In order to improve the accuracy of indel detection, micro-assembly is used in multiple variant callers, such as the GATK HaplotypeCaller to reassemble reads in a specific region of the genome. Assembly is a computationally intensive process that causes runtime bottlenecks. In this paper, we propose a GPU-based de Bruijn graph construction...
conference paper 2018
document
Lei, Q. (author), Chen, G. (author), Meijer, Jonathan (author), Wisse, M. (author)
Increasing grasping efficiency is very important for the robots to grasp unknown objects especially subjected to unfamiliar environments. To achieve this, a new algorithm is proposed based on the C-shape configuration. Specifically, the geometric model of the used under-actuated gripper is approximated as a C-shape. To obtain an appropriate...
journal article 2018
document
Hejderup, J.I. (author), van Deursen, A. (author), Gousios, G. (author)
A popular form of software reuse is the use of open source software libraries hosted on centralized code repositories, such as Maven or npm. Developers only need to declare dependencies to external libraries, and automated tools make them available to the workspace of the project. Recent incidents, such as the Equifax data breach and the leftpad...
conference paper 2018
document
Chepuri, S.P. (author), Eldar, Yonina C. (author), Leus, G.J.T. (author)
In this paper the focus is on sampling and reconstruction of signals supported on nodes of arbitrary graphs or arbitrary signals that may be represented using graphs, where we extend concepts from generalized sampling theory to the graph setting. To recover such signals from a given set of samples, we develop algorithms that incorporate prior...
conference paper 2018
Searched for: subject%3A%22graph%22
(401 - 420 of 553)

Pages