Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
On Extensions of the Unanimous Vote Problem
Evan J. R. Brody, Haya Diwan, Lisa Hellerstein +1
The Unanimous Vote problem is to determine a fixed order in which to flip each of biased coins, where each coin can be flipped only once, such that the expected number of flips…
cs.DS2025
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
Haya Diwan, Lisa Hellerstein, Nicole Megow +1
Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values o…
cs.DS2024
Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
Haya Diwan, Jinrui Gou, Cameron Musco +2
There has been significant recent interest in graph-based nearest neighbor search methods, many of which are centered on the construction of navigable graphs over high-dimensional…