Related papers: Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimen…
Spectral clustering is a well-known technique which identifies $k$ clusters in an undirected graph with weight matrix $W\in\mathbb{R}^{n\times n}$ by exploiting its graph Laplacian $L(W)$, whose eigenvalues $0=\lambda_1\leq \lambda_2 \leq…
Affine Grassmannian has been favored for expressing proximity between lines and planes due to its theoretical exactness in measuring distances among features. Despite this advantage, the existing method can only measure the proximity…
We present Sunyaev-Zel'dovich measurements of 15 massive X-ray selected galaxy clusters obtained with the South Pole Telescope. The Sunyaev-Zel'dovich (SZ) cluster signals are measured at 150 GHz, and concurrent 220 GHz data are used to…
The minimum orbital intersection distance is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications.…
In the last three decades, the Ultra Steep spectrum tecnique has been exploited by many groups since it was demonstrated that radio sources with very steep spectra (Alpha < -1.0) are good tracers of high-z radio galaxies (HzRGs; z>2).…
The past decade has witnessed significant progress on detecting objects in aerial images that are often distributed with large scale variations and arbitrary orientations. However most of existing methods rely on heuristically defined…
We present a novel concept for a compact and robust crossed-beam optical dipole trap (cODT) based on a single lens, designed for the efficient generation of Bose-Einstein condensates (BECs) under dynamic conditions. The system employs two…
Establishing correspondences between two images requires both local and global spatial context. Given putative correspondences of feature points in two views, in this paper, we propose Order-Aware Network, which infers the probabilities of…
Fiber collision is a persistent problem faced by modern spectroscopic galaxy surveys. In this work, we propose a new method to correct for this undesired effect, focusing on the clustering from the fiber-collision scale up to $\lesssim 10…
Recent experiments have demonstrated sub decoherence time control of individual single-electron orbital qubits. Here we propose a quantum dot based scheme for generation and detection of pairs of orbitally entangled electrons on a timescale…
We report on Bloch-Zener oscillations of an ultracold Fermi gas in a tunable honeycomb lattice. The quasi-momentum distribution of the atoms is measured after sequentially passing through two Dirac points. We observe a double-peak feature…
This short contribution presents a method for generating $N$-point spherical configurations with low mesh ratios. The method extends Caspar-Klug icosahedral point-grids to non-icosahedral nets through the use of planar barycentric…
Clustering mixtures of Gaussian distributions is a fundamental and challenging problem that is ubiquitous in various high-dimensional data processing tasks. While state-of-the-art work on learning Gaussian mixture models has focused…
We consider the problem of minimizing the sum of two convex functions. One of those functions has Lipschitz-continuous gradients, and can be accessed via stochastic oracles, whereas the other is "simple". We provide a Bregman-type algorithm…
We propose an efficient algorithm for density fitting of Bloch waves for Hamiltonian operators with periodic potential. The algorithm is based on column selection and random Fourier projection of the orbital functions. The computational…
We define angles from-to and between infinite dimensional subspaces of a Hilbert space, inspired by the work of E. J. Hannan, 1961/1962 for general canonical correlations of stochastic processes. The spectral theory of selfadjoint operators…
We study the design of amplitude phase-shift keying (APSK) constellations for a coherent fiber-optical communication system where nonlinear phase noise (NLPN) is the main system impairment. APSK constellations can be regarded as a union of…
An \emph{$\alpha$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$\alpha$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $\alpha$-approximate distance…
Using 3D point clouds in odometry estimation in robotics often requires finding a set of correspondences between points in subsequent scans. While there are established methods for point clouds of sufficient quality, state-of-the-art still…
Given an idempotent operator $E$ in a complex Hilbert space ${\mathcal H}$, one can associate to it two orthogonal projections: - The polar decomposition $2E-1=(2P-1)|2E-1|$ provides an orthogonal projection $P$. That the unitary part in…