Publications associées à Simple Realizability of Complete Abstract Topological Graphs Simplified

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.

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

Many disjoint edges in topological graphs

Andres Jacinto Ruiz Vargas

A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...

Elsevier Science Bv2017

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

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

Signal-Adapted Tight Frames on Graphs

Dimitri Nestor Alice Van De Ville, Hamid Behjat

The analysis of signals on complex topologies modeled by graphs is a topic of increasing importance. Decompositions play a crucial role in the representation and processing of such information. Here, we propose a new tight frame design that is adapted to a ...

Institute of Electrical and Electronics Engineers2016

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Pierre Vandergheynst, Xavier Bresson, Rodrigo Cerqueira Gonzalez Pena

We cast the problem of source localization on graphs as the simultaneous problem of sparse recovery and diffusion ker- nel learning. An l1 regularization term enforces the sparsity constraint while we recover the sources of diffusion from a single snapshot ...

Ieee2016

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

Simple Realizability of Complete Abstract Topological Graphs Simplified

Graph Chatbot

Chattez avec Graph Search

Towards large scale multimedia indexing: A case study on person discovery in broadcast news

Diverse M-Best Solutions by Dynamic Programming

Many disjoint edges in topological graphs

Independence number of generalized Petersen graphs

Simple topological graphs

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Signal-Adapted Tight Frames on Graphs

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

On the Difficulty of Selecting Ising Models with Approximate Recovery

Many disjoint edges in topological graphs

Towards large scale multimedia indexing: A case study on person discovery in broadcast news

Diverse M-Best Solutions by Dynamic Programming

Independence number of generalized Petersen graphs

Simple topological graphs

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Signal-Adapted Tight Frames on Graphs

On the Difficulty of Selecting Ising Models with Approximate Recovery

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory