Related papers: Random template banks and relaxed lattice covering…
Animal movement studies have become ubiquitous in animal ecology for estimation of space use and analysis of movement behavior. In these studies, animal movement data are primarily collected at regular time intervals. We propose an…
The forthcoming communication systems are advancing towards improved flexibility in various aspects. Improved flexibility is crucial to cater diverse service requirements. This letter proposes a novel waveform design scheme that exploits…
We study random walks in random environments generated by the two-dimensional Gaussian free field. More specifically, we consider a rescaled lattice with a small mesh size and view it as a random network where each edge is equipped with an…
We revisit old ideas that smearing or blocking an SU(N) lattice gauge field, or averaging over an ensemble of fields created in the neighbourhood of that field, can reduce the high frequency fluctuations sufficiently that the naive lattice…
Standard formulations of GANs, where a continuous function deforms a connected latent space, have been shown to be misspecified when fitting different classes of images. In particular, the generator will necessarily sample some low-quality…
In learned image compression, probabilistic models play an essential role in characterizing the distribution of latent variables. The Gaussian model with mean and scale parameters has been widely used for its simplicity and effectiveness.…
In this work the diffusion in the quenched trap model with diverging mean waiting times is examined. The approach of randomly stopped time is extensively applied in order to obtain asymptotically exact representation of the disorder…
We introduce a very general method for sparse and large-scale variable selection. The large-scale regression settings is such that both the number of parameters and the number of samples are extremely large. The proposed method is based on…
Nested sampling is a Bayesian sampling technique developed to explore probability distributions lo- calised in an exponentially small area of the parameter space. The algorithm provides both posterior samples and an estimate of the evidence…
We study stochastic combinatorial optimization problems where the objective is to minimize the expected maximum load (a.k.a.\ the makespan). In this framework, we have a set of $n$ tasks and $m$ resources, where each task $j$ uses some…
We assess the coverage properties of confidence and credible intervals on the CMSSM parameter space inferred from a Bayesian posterior and the profile likelihood based on an ATLAS sensitivity study. In order to make those calculations…
Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…
We propose a new antenna selection scheme for a massive MIMO system with a single user terminal and a base station with a large number of antennas. We consider a practical scenario where there is a realistic correlation among the antennas…
In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over $\mathbb{F}_2=\{0,1\}$ with high probability and can be transformed into echelon form in almost linear time by a simple…
We study a randomized quadrature algorithm to approximate the integral of periodic functions defined over the high-dimensional unit cube. Recent work by Kritzer, Kuo, Nuyens and Ullrich (2019) shows that rank-1 lattice rules with a randomly…
Finding a template in a search image is one of the core problems many computer vision, such as semantic image semantic, image-to-GPS verification \etc. We propose a novel quality-aware template matching method, QATM, which is not only used…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
Robots are still poor at traversing cluttered large obstacles required for important applications like search and rescue. By contrast, animals are excellent at doing so, often using direct physical interaction with obstacles rather than…
The design of irregular planar phased arrays (PAs) characterized by a highly-modular architecture is addressed. By exploiting the property of self-replicating tile shapes, also known as rep-tiles, the arising array layouts consist of tiles…