Publications associées à Degree-constrained edge partitioning in graphs arising from discrete tomography

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.

Geometric Graph Matching Using Monte Carlo Tree Search

Pascal Fua, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present an efficient matching method for generalized geometric graphs. Such graphs consist of vertices in space connected by curves and can represent many real world structures such as road networks in remote sensing, or vessel networks in medical imagi ...

Ieee Computer Soc2017

Efficient Online Processing for Advanced Analytics

Mohamed Elsayed Mohamed Ahmed El Seidy

With the advent of emerging technologies and the Internet of Things, the importance of online data analytics has become more pronounced. Businesses and companies are adopting approaches that provide responsive analytics to stay competitive in the global ma ...

EPFL2017

Lower Bounds on Active Learning for Graphical Model Selection

Volkan Cevher, Jonathan Mark Scarlett

We consider the problem of estimating the underlying graph associated with a Markov random field, with the added twist that the decoding algorithm can iteratively choose which subsets of nodes to sample based on the previous samples, resulting in an active ...

2017

Spinner: Scalable Graph Partitioning in the Cloud

Andreas Loukas, Dionysios Logothetis

In this paper, we present a graph partitioning algorithm to partition graphs with trillions of edges. To achieve such scale, our solution leverages the vertex-centric Pregel abstraction provided by Giraph, a system for large-scale graph analytics. We desig ...

Ieee2017

Diverse M-Best Solutions by Dynamic Programming

Michaël Unser, Virginie Sophie Uhlmann

Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best soluti ...

Springer2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

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 random subgraphs of Kneser and Schrijver graphs

Andrei Kupavskii

A Kneser graph KG(n,k) is a graph whose vertices are in oneto-one correspondence with k -element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lowisz states that the chromatic num ...

Academic Press Inc Elsevier Science2016

Degree-constrained edge partitioning in graphs arising from discrete tomography

Graph Chatbot

Chattez avec Graph Search

Geometric Graph Matching Using Monte Carlo Tree Search

Efficient Online Processing for Advanced Analytics

Lower Bounds on Active Learning for Graphical Model Selection

Spinner: Scalable Graph Partitioning in the Cloud

Diverse M-Best Solutions by Dynamic Programming

A semi-algebraic version of Zarankiewicz's problem

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Simple topological graphs

On random subgraphs of Kneser and Schrijver graphs

Lower Bounds on Active Learning for Graphical Model Selection

A semi-algebraic version of Zarankiewicz's problem

Efficient Online Processing for Advanced Analytics

Diverse M-Best Solutions by Dynamic Programming

Geometric Graph Matching Using Monte Carlo Tree Search

Simple topological graphs

Disjoint edges in topological graphs and the tangled-thrackle conjecture

On random subgraphs of Kneser and Schrijver graphs

Spinner: Scalable Graph Partitioning in the Cloud

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets