Related papers: Template-based searches for gravitational waves: e…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
We prove explicit stability estimates for the sphere packing problem in dimensions 8 and 24, showing that, in the lattice case, if a lattice is $\sim \varepsilon$ close to satisfying the optimal density, then it is, in a suitable sense,…
The effective Fisher matrix method recently introduced by Cho et al. is a semi-analytic approach to the Fisher matrix, in which a local overlap surface is fitted by using a quadratic fitting function. Mathematically, the effective Fisher…
Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can…
Automatic search of neural architectures for various vision and natural language tasks is becoming a prominent tool as it allows to discover high-performing structures on any dataset of interest. Nevertheless, on more difficult domains,…
Searches for gravitational-wave signals are often based on maximizing a detection statistic over a bank of waveform templates, covering a given parameter space with a variable level of correlation. Results are often evaluated using a…
We derive optimal filters on the sphere in the context of detecting compact objects embedded in a stochastic background process. The matched filter and the scale adaptive filter are derived on the sphere in the most general setting,…
We systematically investigate the parameter space of neutrino and charged lepton mass matrices for textures motivated by an extended quark-lepton complementarity. As the basic hypothesis, we postulate that all mixing angles in U_l and U_nu…
The detection of gravitational waves from inspiraling compact binaries using matched filtering depends crucially on the availability of accurate template waveforms. We determine whether the accuracy of the templates' phasing can be improved…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
We derive a simple algebraic criterion to select the optimal detector network for a coherent wide parameter-space (all-sky) search for continuous gravitational waves. Optimality in this context is defined as providing the highest (average)…
We consider the approximate recovery of multivariate periodic functions from a discrete set of function values taken on a rank-$s$ integration lattice. The main result is the fact that any (non-)linear reconstruction algorithm taking…
Graph-based nearest neighbor search methods have seen a surge of popularity in recent years, offering state-of-the-art performance across a wide variety of applications. Central to these methods is the task of constructing a sparse…
Geometric consistency, i.e. the preservation of neighbourhoods, is a natural and strong prior in 3D shape matching. Geometrically consistent matchings are crucial for many downstream applications, such as texture transfer or statistical…
We study noncompact and static membrane solutions in Matrix theory. Demanding axial symmetry on a membrane embedded in three spatial dimensions, we obtain a wormhole solution whose shape is the same with the catenoidal solution of…
Accurate geometric modeling of the aortic valve from 3D CT images is essential for biomechanical analysis and patient-specific simulations to assess valve health or make a preoperative plan. However, it remains challenging to generate…
A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering…
Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain…
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming…
The spin-free binary-inspiral parameter-space introduced by Tanaka and Tagoshi to construct a uniformly-spaced lattice of templates at (and possibly beyond) $2.5PN$ order is shown to work for all first generation interferometric…