14 citations · 44 across the 12 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DM2018★ 4 cited
Optimal Bounds for Johnson-Lindenstrauss Transformations
Michael Burr, Shuhong Gao, Fiona Knoll
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclid…
cs.SC2018
The Complexity of Subdivision for Diameter-Distance Tests
Michael Burr, Shuhong Gao, Elias Tsigaridas
We present a general framework for analyzing the complexity of subdivision-based algorithms whose tests are based on the sizes of regions and their distance to certain sets (often…