Related papers: Template-based searches for gravitational waves: e…
We explore methods of fitting templates to cosmic microwave background (CMB) data, and in particular demonstrate the application of the total convolver algorithm as a fast method of performing a search over all possible locations and…
Problems on repeated geometric patterns in finite point sets in Euclidean space are extensively studied in the literature of combinatorial and computational geometry. Such problems trace their inspiration to Erd\H{o}s' original work on that…
Rapidly rotating neutron stars are promising sources of continuous gravitational waves for the LIGO and Virgo observatories. The majority of neutron stars in our galaxy have not been identified with electromagnetic observations. Blind…
We provide a complete pipeline for the detection of patterns of interest in an image. In our approach, the patterns are assumed to be adequately modeled by a known template, and are located at unknown positions and orientations that we aim…
We present a multi-phase design parameterization to obtain optimized heterogeneous lattice structures. The 3D domain is discretized into a cubical grid wherein each cube has eight distinct unit cell types or phases. When all phases are…
In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. One of the first constraints proposed in pattern mining is…
The low-rank matrix completion problem can be succinctly stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. While several low-complexity algorithms for matrix completion…
We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point…
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
We present a general class of unbiased improved estimators for physical observables in lattice gauge theory computations which significantly reduces statistical errors at modest computational cost. The error reduction techniques, referred…
Determination of design parameters based on electromagnetic simulations of microwave circuits is an iterative and often time-consuming procedure. Space mapping is a powerful technique to optimize such complex models by efficiently…
We present a new technique to compute simultaneously valid confidence intervals for a set of model parameters. We apply our method to the Wilkinson Microwave Anisotropy Probe's (WMAP) Cosmic Microwave Background (CMB) data, exploring a…
A novel unification for the problem of search of optimal clusters under a well pair potential function is presented. My formulation introduces appropriate sets and lattices from where efficient methods can address this problem. First, as…
This paper introduces a heuristic topology optimization framework for thin-walled, 2D extruded lattice structures subject to complex high-speed loading. The proposed framework optimizes the wall thickness distribution in the lattice cross…
We present a novel method for predicting binary phase diagrams through the automatic construction of a minimal basis set of representative templates. The core assumption is that any materials space can be divided into a small number of…
The Dehn function and its higher-dimensional generalizations measure the difficulty of filling a sphere in a space by a ball. In nonpositively curved spaces, one can construct fillings using geodesics, but fillings become more complicated…
The problem of finding overlapping communities in networks has gained much attention recently. Optimization-based approaches use non-negative matrix factorization (NMF) or variants, but the global optimum cannot be provably attained in…
We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…
We examine simulations of the formation of domain walls, cosmic strings, and monopoles on a cubic lattice, in which the topological defects are assumed to lie at the zeros of a piecewise constant 1, 2, or 3 component Gaussian random field,…
In the last decade, the perfectly matched layer (PML) approach has proved a flexible and accurate method for the simulation of waves in unbounded media. Most PML formulations, however, usually require wave equations stated in their standard…