Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Levy, Caleb"'
In this work we demonstrate that Dark Matter (DM) evaporation severely hinders the effectiveness of exoplanets and Brown Dwarfs as sub-GeV DM probes. Moreover, we find useful analytic closed form approximations for DM capture rates for arbitrary astr
Externí odkaz:
http://arxiv.org/abs/2312.13979
Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding methods aim to capture graph structure by learning a low-dimensional ve
Externí odkaz:
http://arxiv.org/abs/2201.08481
Autor:
Ilie, Cosmin, Levy, Caleb
Publikováno v:
Phys. Rev. D 104, 083033 (2021)
In recent years, the usefulness of astrophysical objects as Dark Matter (DM) probes has become more and more evident, especially in view of null results from direct detection and particle production experiments. The potentially observable signatures
Externí odkaz:
http://arxiv.org/abs/2105.09765
This work examines how to train fair classifiers in settings where training labels are corrupted with random noise, and where the error rates of corruption depend both on the label class and on the membership function for a protected subgroup. Hetero
Externí odkaz:
http://arxiv.org/abs/2011.00379
We show that the mere observation of the first stars (Pop III stars) in the universe can be used to place tight constraints on the strength of the interaction between dark matter and regular, baryonic matter. We apply this technique to a candidate Po
Externí odkaz:
http://arxiv.org/abs/2009.11478
Dark Matter (DM) can be trapped by the gravitational field of any star, since collisions with nuclei in dense environments can slow down the DM particle below the escape velocity ($v_{esc}$) at the surface of the star. If captured, the DM particles c
Externí odkaz:
http://arxiv.org/abs/2009.11474
Autor:
Levy, Caleb C., Tarjan, Robert E.
Consider the task of performing a sequence of searches in a binary search tree. After each search, we allow an algorithm to arbitrarily restructure the tree. The cost of executing the task is the sum of the time spent searching and the time spent opt
Externí odkaz:
http://arxiv.org/abs/1907.06310
Autor:
Levy, Caleb C., Tarjan, Robert E.
Let $T$ be a binary search tree. We prove two results about the behavior of the Splay algorithm (Sleator and Tarjan 1985). Our first result is that inserting keys into an empty binary search tree via splaying in the order of either $T$'s preorder or
Externí odkaz:
http://arxiv.org/abs/1907.06309
Publikováno v:
ACM Transactions on Algorithms, 17(4), 34:1--12, 2021
We introduce the zip tree, a form of randomized binary search tree that integrates previous ideas into one practical, performant, and pleasant-to-implement package. A zip tree is a binary search tree in which each node has a numeric rank and the tree
Externí odkaz:
http://arxiv.org/abs/1806.06726
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.