We introduce linear probing hashing schemes that construct a hash table ...
A uniform k-dag generalizes the uniform random recursive tree by
picking...
Motivated by online recommendation systems, we study a family of random
...
We propose a novel, simple density estimation algorithm for bounded mono...
This work considers a problem of estimating a mixing probability density...
We revisit the problem of the estimation of the differential entropy H(f...
We study the problem of estimating the common mean μ of n independent
sy...
This thesis presents analysis of the properties and run-time of the
Rapi...
We introduce and study a family of random processes on trees we call hip...
We propose a simple recursive data-based partitioning scheme which produ...
We prove a lower bound and an upper bound for the total variation distan...
We investigate the size of vertex confidence sets for including part of ...
We show how to sample exactly discrete probability distributions whose
d...
Let G be an undirected graph with m edges and d vertices. We show that
d...
We study local optima of the Hamiltonian of the Sherrington-Kirkpatrick
...
The cellular tree classifier model addresses a fundamental problem in th...