Publications associées à PrefEdge: SSD Prefetcher for Large-Scale Graph Traversal

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.

The power of adaptivity in source identification with time queries on the path

Patrick Thiran, Gergely Odor, Victor Cyril L Lecomte

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph

G=(V,E)

, an unknown source node

v^* \in V

is drawn uniformly at random, ...

2022

PrefEdge: SSD Prefetcher for Large-Scale Graph Traversal

Graph Chatbot

Chattez avec Graph Search

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

A full characterization of invariant embeddability of unimodular planar graphs

Equivariant Neural Architectures for Representing and Generating Graphs

Maximum Independent Set: Self-Training through Dynamic Programming

Privatized graph federated learning

Graph-based approximate message passing iterations

Distributed Graph Learning With Smooth Data Priors

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

The power of adaptivity in source identification with time queries on the path

Privatized graph federated learning

A full characterization of invariant embeddability of unimodular planar graphs

Equivariant Neural Architectures for Representing and Generating Graphs

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Graph-based approximate message passing iterations

Distributed Graph Learning With Smooth Data Priors

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

Maximum Independent Set: Self-Training through Dynamic Programming

The power of adaptivity in source identification with time queries on the path