Publications associées à Cube-connected cycles

OpenPifPaf: Composite Fields for Semantic Keypoint Detection and Spatio-Temporal Association

Alexandre Massoud Alahi, Sven Kreiss, Lorenzo Bertoni

Many image-based perception tasks can be formulated as detecting, associating and tracking semantic keypoints, e.g., human body pose estimation and tracking. In this work, we present a general framework that jointly detects and forms spatio-temporal keypoi ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Adaptive majority problems for restricted query graphs and for weighted sets

Abhishek Methuku, Balázs Keszegh

Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We study th ...

ELSEVIER2021

Graph Signal Processing: Foundations and Emerging Directions [From the Guest Editors]

Dimitri Nestor Alice Van De Ville, Negar Kiyavash

The articles in this special section focus on graph signal processing. Generically, the networks that sustain our societies can be understood as complex systems formed by multiple nodes, where global network behavior arises from local interactions between ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Abhishek Methuku, Balázs Keszegh

COMENIUS UNIV2019

A Novel Method for Sampling Bandlimited Graph Signals

Pascal Frossard, Pinar Akyazi, Dion Eustathios Olivier Tzamarias

In this paper we propose a novel vertex based sampling method for k-bandlimited signals lying on arbitrary graphs, that has a reasonable computational complexity and results in low reconstruction error. Our goal is to find the smallest set of vertices that ...

IEEE COMPUTER SOC2018

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Mario Paolone, Paolo Romano, Marco Pignati, Lorenzo Zanni

A method for a faulted line identification in a power network, including, at a generic time-instant, solving a plurality of parallel phasor measurement units based real-time state estimators, the state estimators having among each other different and augme ...

2017

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

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.

Cube-connected cycles

OpenPifPaf: Composite Fields for Semantic Keypoint Detection and Spatio-Temporal Association

Adaptive majority problems for restricted query graphs and for weighted sets

Graph Signal Processing: Foundations and Emerging Directions [From the Guest Editors]

Symbolic Algorithms for Token Swapping

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

A Novel Method for Sampling Bandlimited Graph Signals

When Stuck, Flip a Coin

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

On random subgraphs of Kneser and Schrijver graphs

Graph Chatbot

Chattez avec Graph Search

Adaptive majority problems for restricted query graphs and for weighted sets

OpenPifPaf: Composite Fields for Semantic Keypoint Detection and Spatio-Temporal Association

Method and System for Fault Detection and Faulted Line Identification in Power Systems using Synchrophasors-Based Real-Time State Estimation

Graph Signal Processing: Foundations and Emerging Directions [From the Guest Editors]

A Novel Method for Sampling Bandlimited Graph Signals

Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets

Symbolic Algorithms for Token Swapping

When Stuck, Flip a Coin

On random subgraphs of Kneser and Schrijver graphs