相关论文: Reduction-Based Creative Telescoping for Definite …

This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulating the entries of transform matrices, our approach derives…

Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying a linear transformation based on a "one-hot" encoding of the discrete symbols. Despite its simplicity, such…

We present \emph{telescoping} recursive representations for both continuous and discrete indexed noncausal Gauss-Markov random fields. Our recursions start at the boundary (a hypersurface in $\R^d$, $d \ge 1$) and telescope inwards. For…

Many real-world sequential manipulation tasks involve a combination of discrete symbolic search and continuous motion planning, collectively known as combined task and motion planning (TAMP). However, prevailing methods often struggle with…

We demonstrate a multi-beam scanning transmission electron microscopy (STEM) imaging that integrates down-sampling with super-resolution image reconstruction via a compressive sensing framework. A custom condenser aperture with six randomly…

In sketched clustering, a dataset of $T$ samples is first sketched down to a vector of modest size, from which the centroids are subsequently extracted. Advantages include i) reduced storage complexity and ii) centroid extraction complexity…

We present a high-performance event reconstruction algorithm: an Image Pixel-wise fit for Atmospheric Cherenkov Telescopes (ImPACT). The reconstruction algorithm is based around the likelihood fitting of camera pixel amplitudes to an…

A new computational algorithm, the discrete singular convolution (DSC), is introduced for computational electromagnetics. The basic philosophy behind the DSC algorithm for the approximation of functions and their derivatives is studied.…

A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.

We consider a sketched implementation of the finite element method for elliptic partial differential equations on high-dimensional models. Motivated by applications in real-time simulation and prediction we propose an algorithm that…

The problem of minimization of the sum of two convex functions has various theoretical and real-world applications. One of the popular methods for solving this problem is the proximal gradient method (proximal forward-backward algorithm). A…

In this note we illustrate how common matrix approximation methods, such as random projection and random sampling, yield projection-cost-preserving sketches, as introduced in [FSS13, CEM+15]. A projection-cost-preserving sketch is a matrix…

This paper develops fast and efficient algorithms for computing Tucker decomposition with a given multilinear rank. By combining random projection and the power scheme, we propose two efficient randomized versions for the truncated…

Telescopes, designed with semi-conductor based photo sensors, have the potential to detect Cherenkov or fluorescence light emitted by cosmic-rays in the atmosphere. Such telescopes promise a high duty cycle and efficiency in remote harsh…

The pointing capability of a telescope in the Cherenkov Telescope Array (CTA) is a crucial aspect in the calibration of the instrument. It describes how a position in the sky is transformed to the focal plane of the telescope and allows…

Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…

3D volume segmentation is a fundamental task in many scientific and medical applications. Producing accurate segmentations efficiently is challenging, in part due to low imaging data quality (e.g., noise and low image resolution) and…

The goal of this thesis is to provide a framework for the use of task-based metrics of image quality to aid in the design, implementation, and evaluation of CT image reconstruction algorithms and CT systems in general. We support the view…

Pointing calibration is an offline correction applied in order to obtain the true pointing direction of a telescope. The Cherenkov Telescope Array (CTA) aims to have the precision to determine the position of point-like as well as slightly…

High precision astrometry aims at source position determination to a very small fraction of the diffraction image size, in high SNR regime. One of the key limitations to such goal is the optical response variation of the telescope over a…