Related papers: Graph search via star sampling with and without re…
In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a…
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028--2042] it is based on the optimization…
Graph signal sampling is the problem of selecting a subset of representative graph vertices whose values can be used to interpolate missing values on the remaining graph vertices. Optimizing the choice of sampling set using concepts from…
Survey observations of the three-dimensional locations of galaxies are a powerful approach to measure the distribution of matter in the universe, which can be used to learn about the nature of dark energy, physics of inflation, neutrino…
Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in…
We present a machine learning method to assign stellar parameters (temperature, surface gravity, metallicity) to the photometric data of large photometric surveys such as SDSS and SKYMAPPER. The method makes use of our previous effort in…
We present a new method for detecting and correcting systematic errors in the distances to stars when both proper motions and line-of-sight velocities are available. The method, which is applicable for samples of 200 or more stars that have…
Suppose that we are given an arbitrary graph $G=(V, E)$ and know that each edge in $E$ is going to be realized independently with some probability $p$. The goal in the stochastic matching problem is to pick a sparse subgraph $Q$ of $G$ such…
Series photo selection (SPS) is an important branch of the image aesthetics quality assessment, which focuses on finding the best one from a series of nearly identical photos. While a great progress has been observed, most of the existing…
We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…
Parameter estimation in astrophysics often requires the use of complex physical models. In this paper we study the problem of estimating the parameters that describe star formation history (SFH) in galaxies. Here, high-dimensional spectral…
The first step toward doing high-precision astrometry is the measurement of individual stars in individual images, a step that is fraught with dangers when the images are undersampled. The key to avoiding systematic positional error in…
Sketch-based streaming algorithms allow efficient processing of big data. These algorithms use small fixed-size storage to store a summary ("sketch") of the input data, and use probabilistic algorithms to estimate the desired quantity.…
In this paper, a new modification of ranked set sampling (RSS) is suggested, namely; unified ranked set sampling (URSS) for estimating the population mean and variance. The performance of the empirical mean and variance estimators based on…
Selecting regularization parameters in penalized high-dimensional graphical models in a principled, data-driven, and computationally efficient manner continues to be one of the key challenges in high-dimensional statistics. We present…
We present a method to infer reddenings and distances to stars, based only on their broad-band photometry, and show how this method can be used to produce a three-dimensional dust map of the Galaxy. Our method samples from the full…
Estimating stellar masses and radii is a challenge for most of the stars but their knowledge is critical for many different astrophysical fields. One of the most extended techniques for estimating these variables are the so-called empirical…
The Chinese Space Station Optical Survey (CSS-OS) is a mission to explore the vast universe. This mission will equip a 2-meter space telescope to perform a multi-band NUV-optical large area survey (over 40% of the sky) and deep survey (~1%…
Sampling of signals belonging to a low-dimensional subspace has well-documented merits for dimensionality reduction, limited memory storage, and online processing of streaming network data. When the subspace is known, these signals can be…
To reduce cost in storing, processing and visualizing a large-scale point cloud, we consider a randomized resampling strategy to select a representative subset of points while preserving application-dependent features. The proposed strategy…