NSF-BSF: AF: Small: New Frontiers in Distance Sketching — NSF Award to University of Massachusetts Amherst (MA, $450,000)
Modern datasets are massive, posing a serious challenge to processing and storage. A principled approach for dealing with massive (metric) data is distance sketching. A distance sketch of a metric space (or a graph) is a compact structure that approximately preserves the distances between every pair of points (or verti
| Award title | NSF-BSF: AF: Small: New Frontiers in Distance Sketching |
|---|---|
| Award ID | 2517033 |
| Awardee | University of Massachusetts Amherst |
| City | AMHERST |
| State | MA |
| Amount obligated | $450,000 |
| Principal investigator | Hung Le |
| Program | Algorithmic Foundations |
| Start date | 07/15/2025 |
| Abstract | Modern datasets are massive, posing a serious challenge to processing and storage. A principled approach for dealing with massive (metric) data is distance sketching. A distance sketch of a metric space (or a graph) is a compact structure that approximately preserves the distances between every pair of points (or vertices). The two most basic compactness measures are the size (i.e., the number of edges) and weight (i.e., the total edge weights) of the sketch. The compactness makes distance sketc |
| Source | NSF Awards |
$799/mo
Try NSFGrants →