Decomposition of multiple coverings into many parts

János Pach
2007
Conference Papers

Source officielle

À propos
Confidentialité
Mentions légales

Graph Chatbot

János Pach
2007
Conference Papers

Source officielle

Publications associées (6)

Afficher plus

https://infoscience.epfl.ch/entities/publication/013802c2-c122-4866-896c-5cf69a0a9796

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (6)

Afficher plus

Graph sparsification, sketching and adaptivity

Mikhail Makarov

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

Symmetry and Invariant Bases in Finite Element Exterior Calculus

Martin Werner Licht

We study symmetries of bases and spanning sets in finite element exterior calculus, using representation theory. We want to know which vector-valued finite element spaces have bases invariant under permutation of vertex indices. The permutations of vertex ...

2023

Sparse Approximation Using M-Term Pursuit and Application in Image and Video Coding

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal compon ...

Institute of Electrical and Electronics Engineers2012