#### Filter Results:

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Chi-Kit Lam
- 2014

1 Overview In this lecture we will talk about adaptive sparse recovery. 2 Adaptivity in group testing In sparse recovery, we have y = Ax = In our previous non-adaptive setting, v i 's were chosen independently. Intuitively, it seems we may be able to do better if they are not independent. So, in the adaptive setting we talk about today, The idea is, for… (More)

- Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
- ArXiv
- 2016

We study variants of the stable marriage and college admissions models in which the agents are allowed to express weak preferences over the set of agents on the other side of the market and the option of remaining unmatched. For the problems that we address, previous authors have presented polynomial-time algorithms for computing a " Pareto-stable "… (More)

- Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
- ISAAC
- 2016

Consider a complete weighted bipartite graph G in which each left vertex u has two real numbers intercept and slope, each right vertex v has a real number quality, and the weight of any edge (u, v) is defined as the intercept of u plus the slope of u times the quality of v. Let m (resp., n) denote the number of left (resp., right) vertices, and assume that… (More)

- Chi-Kit Lam
- 2014

1 Overview In this lecture we will talk about information and compression, which the Huffman coding can achieve with the average number of bits sent almost precisely equal to the entropy. Then we will talk about communication complexity and information cost, which is the asymptotic number of bits two parties need to transmit in a conversation in order to… (More)

- Siu-Wing Cheng, Chi-Kit Lam
- Comput. Geom.
- 2013

We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under translation in O(n 2 ε −3) time. The error is additive and it is at most ε · min{area(P), area(Q)} with… (More)

- ‹
- 1
- ›