Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Baron, Jacob"'
Autor:
Baron, Jacob D., Darling, R. W. R.
A Java parallel streams implementation of the $K$-nearest neighbor descent algorithm is presented using a natural statistical termination criterion. Input data consist of a set $S$ of $n$ objects of type V, and a Function>, which ena
Externí odkaz:
http://arxiv.org/abs/2202.00517
A triplet comparison oracle on a set $S$ takes an object $x \in S$ and for any pair $\{y, z\} \subset S \setminus \{x\}$ declares which of $y$ and $z$ is more similar to $x$. Partitioned Local Depth (PaLD) supplies a principled non-parametric partiti
Externí odkaz:
http://arxiv.org/abs/2108.08864
Autor:
Baron, Jacob D., Darling, R. W. R.
Suppose $V$ is an $n$-element set where for each $x \in V$, the elements of $V \setminus \{x\}$ are ranked by their similarity to $x$. The $K$-nearest neighbor graph is a directed graph including an arc from each $x$ to the $K$ points of $V \setminus
Externí odkaz:
http://arxiv.org/abs/1908.07645
Autor:
Baron, Jacob D., Kahn, Jeff
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 number that occur disjointly. This provides a handy tool for bounding u
Externí odkaz:
http://arxiv.org/abs/1905.02883
Autor:
ACME Collaboration, Baron, Jacob, Campbell, Wes C., DeMille, David, Doyle, John M., Gabrielse, Gerald, Gurevich, Yulia V., Hess, Paul W., Hutzler, Nicholas R., Kirilov, Emil, Kozyryev, Ivan, O'Leary, Brendon R., Panda, Cristian D., Parsons, Maxwell F., Spaun, Benjamin, Vutha, Amar C., West, Adam D., West, Elizabeth P.
Publikováno v:
New J. Phys. 19 073029 (2017)
We recently set a new limit on the electric dipole moment of the electron (eEDM) (J. Baron et al., ACME collaboration, Science 343 (2014), 269-272), which represented an order-of-magnitude improvement on the previous limit and placed more stringent c
Externí odkaz:
http://arxiv.org/abs/1612.09318
Autor:
Baron, Jacob D., Kahn, Jeff
Publikováno v:
Random Structures and Algorithms 2018
Write $\mathcal{C}(G)$ for the cycle space of a graph $G$, $\mathcal{C}_\kappa(G)$ for the subspace of $\mathcal{C}(G)$ spanned by the copies of the $\kappa$-cycle $C_\kappa$ in $G$, $\mathcal{T}_\kappa$ for the class of graphs satisfying $\mathcal{C
Externí odkaz:
http://arxiv.org/abs/1610.01276
Autor:
Baron, Jacob D., Kahn, Jeff
Publikováno v:
Combinatorics, Probability and Computing (2016) 25, 645-67
An old conjecture of Zs. Tuza says that for any graph $G$, the ratio of the minimum size, $\tau_3(G)$, of a set of edges meeting all triangles to the maximum size, $\nu_3(G)$, of an edge-disjoint triangle packing is at most 2. Here, disproving a conj
Externí odkaz:
http://arxiv.org/abs/1408.4870
Autor:
ACME Collaboration, Baron, Jacob, Campbell, Wesley C., DeMille, David, Doyle, John M., Gabrielse, Gerald, Gurevich, Yulia V., Hess, Paul W., Hutzler, Nicholas R., Kirilov, Emil, Kozyryev, Ivan, O'Leary, Brendon R., Panda, Cristian D., Parsons, Maxwell F., Petrik, Elizabeth S., Spaun, Ben, Vutha, Amar C., West, Adam D.
Publikováno v:
Science Vol. 343 no. 6168 pp. 269-272 (2014)
The Standard Model (SM) of particle physics fails to explain dark matter and why matter survived annihilation with antimatter following the Big Bang. Extensions to the SM, such as weak-scale Supersymmetry, may explain one or both of these phenomena b
Externí odkaz:
http://arxiv.org/abs/1310.7534