The following pages link to (Q2768280):
Displaying 5 items.
- An explicit bound on the transportation cost distance (Q380692) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
- Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials (Q5236643) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
