Publications related to Expander graph

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Ola Nils Anders Svensson

We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approxima ...

Society for Industrial and Applied Mathematics2011

Wavelets on graphs via spectral graph theory

Pierre Vandergheynst, Rémi Gribonval

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral deco ...

Elsevier2011

Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

2010

Vector Network Coding Algorithms

Christina Fragouli, Javad Ebrahimi Boroojeni

2010

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools and identifying defective items based on tests obtained for each pool. Motivated by applications in network tomography, sensor networks and infection propagati ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools and identifying defective items based on tests obtained for each pool. Motivated by applications in network tomography, sensor networks and infection propagati ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Expander graph

Graph Chatbot

Chat with Graph Search

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Graph-Constrained Group Testing

A Game Theoretic Approach to Expander-based Compressive Sensing

Overlap properties of geometric expanders

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Wavelets on graphs via spectral graph theory

Vector Network Coding

Vector Network Coding Algorithms

A bipartite strengthening of the Crossing Lemma

Graph-Constrained Group Testing

Overlap properties of geometric expanders

A bipartite strengthening of the Crossing Lemma

Graph-Constrained Group Testing

A Game Theoretic Approach to Expander-based Compressive Sensing

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Vector Network Coding Algorithms

Vector Network Coding

Wavelets on graphs via spectral graph theory

Graph-Constrained Group Testing

A Fast Hadamard Transform for Signals with Sub-linear Sparsity