16 citations · 21 across the 6 of their papers we have counts for
6 papers
Empirical complexity of comparator-based nearest neighbor descent
Jacob D. Baron, R. W. R. Darling
A Java parallel streams implementation of the -nearest neighbor descent algorithm is presented using a natural statistical termination criterion. Input data consist of a set …
Partitioned K-nearest neighbor local depth for scalable comparison-based learning
Jacob D. Baron, R. W. R. Darling, J. Laylon Davis +1
A triplet comparison oracle on a set takes an object and for any pair declares which of and is more similar to . Parti…
K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle
Jacob D. Baron, R. W. R. Darling
Suppose is an -element set where for each , the elements of are ranked by their similarity to . The -nearest neighbor graph is a directed…
A Natural Extension of the BK Inequality
Jacob D. Baron, Jeff Kahn
We extend the seminal van den Berg-Kesten Inequality on disjoint occurrence of two events to a setting with arbitrarily many events, where the quantity of interest is the maximum n…
On the Cycle Space of a Random Graph
Jacob D. Baron, Jeff Kahn
Write for the cycle space of a graph , for the subspace of spanned by the copies of the -cycle in , $\mathcal{T}…
Tuza's Conjecture is Asymptotically Tight for Dense Graphs
Jacob D. Baron, Jeff Kahn
An old conjecture of Zs. Tuza says that for any graph , the ratio of the minimum size, , of a set of edges meeting all triangles to the maximum size, , of an edg…