2 citations · 7 across the 18 of their papers we have counts for
4 papers · 1 filter
Graph Spanners in the Message-Passing Model
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative…
The Query Complexity of Mastermind with Distances
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Consider a variant of the Mastermind game in which queries are distances, rather than the usual Hamming distance. That is, a codemaker chooses a hidden vector $\mathbf{y}\…
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel -means clustering (KKMC) on input…
The nonlinear stability regime of the viscous Faraday wave problem
David Altizio, Ian Tice, Xinyu Wu +1
This paper concerns the dynamics of a layer of incompressible viscous fluid lying above a vertically oscillating rigid plane and with an upper boundary given by a free surface. We…