Publications associées à Representation Learning for Multi-relational Data

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

GDSP: A graphical perspective on the distributed storage systems

Michael Christoph Gastpar, Saeid Sahraei

The classical distributed storage problem can be modeled by a k-uniform complete hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vert ...

2017

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

Scaling a Reliable Distributed System

Alexandre David Olivier Maurer

We consider the problem of reliably connecting an arbitrarily large set of computers (nodes) with communication channels. Reliability means here the ability, for any two nodes, to remain connected (i.e., their ability to communicate) with probability at le ...

LPD EPFL2016

Learning Laplacian Matrix in Smooth Graph Signal Representations

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful graph is not alwa ...

Institute of Electrical and Electronics Engineers2016

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

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Andres Jacinto Ruiz Vargas

It is shown that fora constant t is an element of N, every simple topological graph on n vertices has 0(n) edges if the graph has no two sets of t edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of th ...

Academic Press Ltd- Elsevier Science Ltd2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Constant Factor Approximation for ATSP with Two Edge Weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

Springer Int Publishing Ag2016

Representation Learning for Multi-relational Data

Graph Chatbot

Chattez avec Graph Search

GDSP: A graphical perspective on the distributed storage systems

Assembling a Network out of Ambiguous Patches

Graph Signal Processing

Scaling a Reliable Distributed System

Learning Laplacian Matrix in Smooth Graph Signal Representations

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Disjoint edges in topological graphs and the tangled-thrackle conjecture

From data to structures

On the Difficulty of Selecting Ising Models with Approximate Recovery

Constant Factor Approximation for ATSP with Two Edge Weights

Scaling a Reliable Distributed System

Graph Signal Processing

From data to structures

Assembling a Network out of Ambiguous Patches

On the Difficulty of Selecting Ising Models with Approximate Recovery

Learning Laplacian Matrix in Smooth Graph Signal Representations

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Constant Factor Approximation for ATSP with Two Edge Weights

GDSP: A graphical perspective on the distributed storage systems