Publication

OCL and Graph-Transformations – A Symbiotic Alliance to Alleviate the Frame Problem

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Slepian Guided Filtering of Graph Signals

Dimitri Nestor Alice Van De Ville, Miljan Petrovic

Joint localization of graph signals in vertex and spectral domain is achieved in Slepian vectors calculated by either maximizing energy concentration (mu) or minimizing modified embedded distance (xi) in the subgraph of interest. On the other hand, graph L ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Assembling a Network out of Ambiguous Patches

Matthias Grossglauser, Lyudmila Yartseva, Jefferson Elbert Simões

Many graph mining and network analysis problems rely on the availability of the full network over a set of nodes. But inferring a full network is sometimes non-trivial if the raw data is in the form of many small {\em patches} or subgraphs, of the true net ...

2016

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

2016

Deconvolution of Gaussian Random Fields using the Graph Fourier Transform

Matthieu Martin Jean-André Simeoni

Real-life acquisition systems are fundamentally limited in their ability to reproduce point sources. For example, a point source object, a star say, observed with an optical telescope is blurred by the imperfect lenses composing the system. Mathematically, ...

2016

SLA: to Sign or Not to Sign

Gil Regev, Alain Wegmann, Gorica Tapandjieva Sekulovska

We present our experience of a three-week fieldwork in the form of a contextual inquiry with a service manager at the EPFL IT department. During these three weeks, we encounter a refusal of a user committee to sign a service-level agreement (SLA). We descr ...

CEUR Workshop Proceedings2016

Modeling and Controlling epidemics : a graph perspective

Philippe Sakari Rossinelli

The social and economical impact a virus has in a population is not negligible. For this reason, gaining a theoretical understanding of the behavior of a virus is of prime importance. This project is going to be divided in several parts. First, we will dis ...

2015

Reversible Sesqui-Pushout Rewriting, Graph Transformation

Sandro Stucki

The paper proposes a variant of sesqui-pushout rewriting (SqPO) that allows one to develop the theory of nested application conditions (NACs) for arbitrary rule spans; this is a considerable generalisation compared with existing results for NACs, which onl ...

Springer2014

The Range of a Random Walk on a Comb

János Pach, Gábor Tardos

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of the neighbors of ...

Electronic Journal Of Combinatorics2013

Graph-based representation and coding of multiview geometry

Pascal Frossard, Thomas Maugey

We propose a new approach for describing the geometry information of multiview image representations. Rather than transmitting the raw geometry of the scene, under the form of depth information, we build a graph that represents the connections between corr ...

2013

Graph Transformations preserving the stability number

Dominique de Werra

We analyze the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...

Elsevier Science Bv2012