Search Results for author:
Found 4 papers, 0 papers with code
Efficient Approximate Recovery from Pooled Data Using Doubly Regular Pooling Schemes
In the pooled data problem we are given $n$ agents with hidden state bits, either $0$ or $1$.
Inference of a Rumor's Source in the Independent Cascade Model
In this work we present a maximum likelihood estimator for the rumor's source, given a snapshot of the process in terms of a set of active nodes $X$ after $t$ steps.
Distributed Reconstruction of Noisy Pooled Data
In the pooled data problem we are given a set of $n$ agents, each of which holds a hidden state bit, either $0$ or $1$.
On Greedily Packing Anchored Rectangles
For each point p in P you may draw a rectangle in U with its lower-left corner in p. What is the maximum area such rectangles can cover without overlapping each other?
Computational Geometry Data Structures and Algorithms
