Related papers: Template-based searches for gravitational waves: e…
In signal detection problems, one is usually faced with the task of searching a parameter space for peaks in the likelihood function which indicate the presence of a signal. Random searches have proven to be very efficient as well as easy…
Models of physics beyond the Standard Model often contain a large number of parameters. These form a high-dimensional space that is computationally intractable to fully explore. Experimental constraints project onto a subspace of viable…
We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…
$Aims.$ We present a database of 43,340 atmospheric models ($\sim$80,000 models at the conclusion of the project) for stars with stellar masses between 9 and 120 $M_{\odot}$, covering the region of the OB main-sequence and Wolf-Rayet (W-R)…
We give a new framework for solving the fundamental problem of low-rank matrix completion, i.e., approximating a rank-$r$ matrix $\mathbf{M} \in \mathbb{R}^{m \times n}$ (where $m \ge n$) from random observations. First, we provide an…
We study gravitational wave searches for merging binary neutron stars (NSs). We use nonspinning template waveforms towards the signals emitted from aligned-spin NS-NS binaries, in which the spins of the NSs are aligned with the orbital…
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
There is a recently discovered formulation of the multidimensional consistency integrability condition for lattice equations, called consistency-around-a-face-centered-cube(CAFCC), which is applicable to equations defined on a vertex and…
Ball Mapper is an widely used tool in topological data analysis for summarizing the structure of high-dimensional data through metric-based coverings and graph representations. A central computational bottleneck in Ball Mapper is the…
Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search…
Wide parameter space searches for long lived continuous gravitational wave signals are computationally limited. It is therefore critically important that available computational resources are used rationally. In this paper we consider…
We consider an optimal stretching problem for strictly convex domains in $\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$.…
We study the problem of all sky search in reference to continuous gravitational wave (CGW) whose wave-form are known in advance. We employ the concept of Fitting Factor and study the variation in the bank of search templates with different…
We study the problem of recovering an incomplete $m\times n$ matrix of rank $r$ with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer…
Lattice rules are among the most prominently studied quasi-Monte Carlo methods to approximate multivariate integrals. A rank-1 lattice rule to approximate an $s$-dimensional integral is fully specified by its generating vector $\mathbf{z}…
We present a method for efficiently searching long-duration gravitational wave signals from compact binary coalescences (CBCs). The approach exploits the smooth frequency-domain behavior of ratios between neighboring waveform templates. The…
We systematically investigate general forms of mass matrices for three-generation up and down quarks, including asymmetrical ones in generation space. Viable zero matrix elements are explored which are compatible with the current…
Emerging location-based systems and data analysis frameworks requires efficient management of spatial data for approximate and exact search. Exact similarity search can be done using space partitioning data structures, such as Kd-tree,…
We consider the quantum analogue of the pattern matching problem, which consists of classifying a given unknown system according to certain predefined pattern classes. We address the problem of quantum template matching in which each…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…