Search Results for author:
Found 5 papers, 3 papers with code
Machine Learning of the Prime Distribution
In the present work we use maximum entropy methods to derive several theorems in probabilistic number theory, including a version of the Hardy-Ramanujan Theorem.
A ripple in time: a discontinuity in American history
It is worth noting that SOTU addresses provide relatively small writing samples (with about 8'000 words on average, and varying widely from under 2'000 words to more than 20'000), and that the number of authors is relatively large (we used SOTU addresses of 42 US presidents).
Robust affine point matching via quadratic assignment on Grassmannians
Robust Affine matching with Grassmannians (RAG) is a new algorithm to perform affine registration of point clouds.
An approach to robust ICP initialization
In this note, we propose an approach to initialize the Iterative Closest Point (ICP) algorithm to match unlabelled point clouds related by rigid transformations.
Graph-based Nearest Neighbor Search in Hyperbolic Spaces
From a theoretical perspective, we rigorously analyze the time and space complexity of graph-based NNS, assuming that an n-element dataset is uniformly distributed within a d-dimensional ball of radius R in the hyperbolic space of curvature -1.
