Choongbum Lee

activity

20082018

most citedSome advances on Sidorenko's conjecture

37 citations · 146 across the 27 of their papers we have counts for

collaborators

37 papers

math.CO2018★ 4 cited

Sidorenko's conjecture for higher tree decompositions

David Conlon, Jeong Han Kim, Choongbum Lee +1

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for str…

cs.CV2016★ 8 cited

ShapeFit and ShapeKick for Robust, Scalable Structure from Motion

Thomas Goldstein, Paul Hand, Choongbum Lee +2

We introduce a new method for location recovery from pair-wise directions that leverages an efficient convex program that comes with exact recovery guarantees, even in the presence…

math.CO2015

Packing spanning graphs from separable families

Asaf Ferber, Choongbum Lee, Frank Mousset

Let $G$ be a separable family of graphs. Then for all positive constants $ε$ and $Δ$ and for every sufficiently large integer $n$ , every sequence $G_1,\dotsc,G_t\in\mathca…

math.CO2015★ 37 cited

Some advances on Sidorenko's conjecture

David Conlon, Jeong Han Kim, Choongbum Lee +1

A bipartite graph $H$ is said to have Sidorenko's property if the probability that the uniform random mapping from $V (H)$ to the vertex set of any graph $G$ is a homomorphism is at…

cs.CV2015

Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences

Paul Hand, Choongbum Lee, Vladislav Voroninski

Let $t_{1}, \dots, t_{n_{l}} \in R^{d}$ and $p_{1}, \dots, p_{n_{s}} \in R^{d}$ and consider the bipartite location recovery problem: given a subset of pairwise direction obser…

cs.CV2015

ShapeFit: Exact location recovery from corrupted pairwise directions

Paul Hand, Choongbum Lee, Vladislav Voroninski

Let $t_{1}, \dots, t_{n} \in R^{d}$ and consider the location recovery problem: given a subset of pairwise direction observations $\{(t_i - t_j) / \|t_i - t_j\|_2\}_{i<j \in [n]…