32 citations · 50 across the 21 of their papers we have counts for
Showing 2026 · cs.DSShow all
2 papers · 2 filters
cs.DS2026
Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds
Deeparnab Chakrabarty, Aditi Dudeja, David Saulpic
We study the round complexity of learning a hidden partition of an -element universe using PAIR queries: PAIR() tells us whether and belong to the sam…
cs.DS2026
Terminal Dimension Reduction for Time Series with Applications
Alexander Munteanu, Matteo Russo, David Saulpic +1
Terminal embeddings have emerged as a powerful tool for dimension reduction. Given a set of points , a terminal embedding is a mapping $f:\mathbb{R}^d\righta…