Related papers: Spectral binning of precomputed correlated-k coeff…

We present an ultrafast opacity calculator that we name HELIOS-K. It takes a line list as an input, computes the shape of each spectral line and provides an option for grouping an enormous number of lines into a manageable number of bins.…

We present the easy-to-use, publicly available, Python package petitRADTRANS, built for the spectral characterization of exoplanet atmospheres. The code is fast, accurate, and versatile; it can calculate both transmission and emission…

Simple yet accurate results for radiative transfer in layered media with discontinuous refractive index are obtained by the method of K-integrals, originally developed for neutron transport analysis. These are certain weighted integrals…

The vibrational response of structural components carries valuable information about their underlying mechanical properties, health status and operational conditions. This underscores the need for the development of efficient physics-based…

We consider a network of binary-valued sensors with a fusion center. The fusion center has to perform K-means clustering on the binary data transmitted by the sensors. In order to reduce the amount of data transmitted within the network,…

Atmospheric escape is crucial to understand the evolution of planets in and out of the Solar system and to interpret atmospheric observations. While hydrodynamic escape simulations have been actively developed incorporating detailed…

Spectral clustering is one of the most effective clustering approaches that capture hidden cluster structures in the data. However, it does not scale well to large-scale problems due to its quadratic complexity in constructing similarity…

The broadening of lines by Stark effect is widely used for inferring electron density and temperature in plasmas. Stark-effect calculations often rely on atomic data (transition rates, energy levels,...) not always exhaustive and/or valid…

A key challenge in modeling (exo)planetary atmospheres lies in generating extensive opacity datasets that cover the wide variety of possible atmospheric composition, pressure, and temperature conditions. This critical step requires specific…

Here we apply hyperspectral bright field imaging to collect computed tomographic images with excellent energy resolution (800 eV), applying it for the first time to map the distribution of stain in a fixed biological sample through its…

Modern Gradient Boosted Decision Trees (GBDTs) accelerate split finding with histogram-based binning, which reduces complexity from $O(N\log N)$ to $O(N)$ by aggregating gradients into fixed-size bins. However, the predominant quantile…

This paper considers the problem of undersampled MRI reconstruction. We propose a novel Transformer-based framework for directly processing signal in k-space, going beyond the limitation of regular grids as ConvNets do. We adopt an implicit…

Adaptive binning is a crucial step in the analysis of large astronomical datasets, such as those from integral-field spectroscopy, to ensure a sufficient signal-to-noise ratio (S/N) for reliable model fitting. However, the widely used…

The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in different subsets. This problem has significant applications across…

In this chapter we review the main literature related to kernel spectral clustering (KSC), an approach to clustering cast within a kernel-based optimization setting. KSC represents a least-squares support vector machine based formulation of…

Traditional k-means clustering underperforms on non-convex shapes and requires the number of clusters k to be specified in advance. We propose a simple geometric enhancement: after standard k-means, each cluster center is assigned a radius…

Purpose: The radial k-space trajectory is a well-established sampling trajectory used in conjunction with magnetic resonance imaging. However, the radial k-space trajectory requires a large number of radial lines for high-resolution…

Kernel density estimation on a finite interval poses an outstanding challenge because of the well-recognized bias at the boundaries of the interval. Motivated by an application in cancer research, we consider a boundary constraint linking…

We propose a method for non-parametric conditional distribution estimation based on partitioning covariate-sorted observations into contiguous bins and using the within-bin empirical CDF as the predictive distribution. Bin boundaries are…

This paper addresses the covariate shift problem in the context of nonparametric regression within reproducing kernel Hilbert spaces (RKHSs). Covariate shift arises in supervised learning when the input distributions of the training and…