Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

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.

In this thesis we address the computation of a spectral decomposition for symmetric banded matrices. In light of dealing with large-scale matrices, where classical dense linear algebra routines are not applicable, it is essential to design alternative tech ...

A novel approach is presented for constructing polynomial chaos representations of scalar quantities of interest (QoI) that extends previously developed methods for adaptation in Homogeneous Chaos spaces. In this work, we develop a Bayesian formulation of ...

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and more. In this pa ...

In this paper, we consider the problem of jointly localizing a microphone array and identifying the direction of arrival of acoustic events. Under the assumption that the sources are in the far field, this problem can be formulated as a constrained low-ran ...

We prove polarization theorems for arbitrary classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation, and an Anion-style transformation is applied using this operation. It is shown that as the number of pola ...

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of tests. We characterize the information-theoretic performance limits in the presence of list decoding, in whi ...

We show that the first -Betti number of the duals of the free unitary quantum groups is one, and that all -Betti numbers vanish for the duals of the quantum automorphism groups of full matrix algebras. ...

Compressed sensing is a new trend in signal processing for efficient sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by ta ...

We study spectral properties of generalized weighted Hilbert matrices. In particular, we establish results on the spectral norm, the determinant, and various relations between the eigenvalues and eigenvectors of such matrices. We also study the asymptotic ...

We present the results from nine years of optically monitoring the gravitationally lensed z(QSO) = 0.658 quasar RX J1131-1231. The R-band light curves of the four individual images of the quasar were obtained using deconvolution photometry for a total of 7 ...

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Chattez avec Graph Search

Fast hierarchical solvers for symmetric eigenvalue problems

Bayesian adaptation of chaos representations using variational inference and sampling on geodesics

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Structure from sound with incomplete data

Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs

How little does non-exact recovery help in group testing?

On the -Betti numbers of universal quantum groups

Compressed Sensing of Memoryless Sources : A Deterministic Hadamard Construction

On Generalized Weighted Hilbert Matrices

COSMOGRAIL: the COSmological MOnitoring of GRAvItational Lenses XIII. Time delays and 9-yr optical monitoring of the lensed quasar RX J1131-1231