Morteza Zadimoghaddam

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Compression with Graphical Constraints: An Interactive Browser

Amin Karbasi, Morteza Zadimoghaddam

We study the problem of navigating/searching through a database of objects with potentially different popularities using a membership oracle. The membership oracle, given a subset of objects

A

, and a target object

t

, determines whether

A

contains

t

...

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

Sequential Group Testing with Graph Constraints

Amin Karbasi, Morteza Zadimoghaddam

In conventional group testing, the goal is to detect a small subset of defecting items

\mathcal{D}

in a large population

\mathcal{N}

by grouping \textit{arbitrary} subset of

\mathcal{N}

into different pools. The result of each group test $\mathcal{T} ...

Ieee2012

Graph Chatbot

Constrained Binary Identification Problem

Sequential Group Testing with Graph Constraints

Compression with Graphical Constraints: An Interactive Browser

Constrained Binary Identification Problem

Compression with Graphical Constraints: An Interactive Browser

Sequential Group Testing with Graph Constraints