相关论文: MAPCUMBA : a fast iterative multi-grid map-making …

A preferred method to detect the curl-component, or B-mode, signature of inflationary gravitational waves (IGWs) in the cosmic microwave background (CMB) polarization, in the absence of foregrounds and lensing, is a prolonged integration…

Memory bandwidth regulation and cache partitioning are widely used techniques for achieving predictable timing in real-time computing systems. Combined with partitioned scheduling, these methods require careful co-allocation of tasks and…

Efficient Graph processing is challenging because of the irregularity of graph algorithms. Using GPUs to accelerate irregular graph algorithms is even more difficult to be efficient, since GPU's highly structured SIMT architecture is not a…

We describe an algorithm for the extraction of the angular power spectrum of an intensity field, such as the cosmic microwave background (CMB), from interferometer data. This new method, based on the gridding of interferometer visibilities…

In this paper we derive an efficient method for computing the indices associated with an asymptotically optimal upper confidence bound algorithm (MDP-UCB) of Burnetas and Katehakis (1997) that only requires solving a system of two…

Training Large Language Models (LLMs) on long contexts is severely constrained by prohibitive GPU memory overhead, not training time. The primary culprits are the activations, whose memory footprints scale linearly with sequence length. We…

We revisit the problem of exact CMB likelihood and power spectrum estimation with the goal of minimizing computational cost through linear compression. This idea was originally proposed for CMB purposes by Tegmark et al.\ (1997), and here…

We propose an optimization-based approach to plan power grasps. Central to our method is a reformulation of grasp planning as an infinite program under complementary constraints (IPCC), which allows contacts to happen between arbitrary…

In this work we deal with the problem of simultaneous multifrequency detection of extragalactic point sources in maps of the Cosmic Microwave Background. We apply a linear filtering technique that uses spatial information and the…

We propose a new computational framework that combines the recently developed time-parallel (TP) and the compound wavelet matrix (CWM) methods. The framework, termed tpCWM, offers significant computational acceleration by making…

We consider time varying MIMO fading channels with known spatial and temporal correlation and solve the problem of joint carrier frequency offset (CFO) and channel estimation with prior distributions. The maximum a posteriori probability…

Radio map (RM) has recently attracted much attention since it can provide real-time and accurate spatial channel information for 6G services and applications. However, current deep learning-based methods for RM construction exhibit well…

Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency,…

We use a high-accuracy computational code to investigate the precision with which cosmological parameters could be reconstructed by future cosmic microwave background (CMB) experiments, in particular the two satellite missions MAP and…

To minimize instrumentally induced systematic errors, cosmic microwave background (CMB) anisotropy experiments measure temperature differences across the sky using paires of horn antennas, temperature map is recovered from temperature…

In radio astronomy, the challenge of reconstructing a sky map from time ordered data (TOD) is known as an inverse problem. Standard map-making techniques and gridding algorithms are commonly employed to address this problem, each offering…

Precise estimation of cosmological parameters from the cosmic microwave background (CMB) remains a central goal of modern cosmology and a key test of inflationary physics. However, this task is fundamentally limited by strong foreground…

We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are computationally expensive. A large dense roadmap (graph) can…

Autonomous robots are widely utilized for mapping and exploration tasks due to their cost-effectiveness. Multi-robot systems offer scalability and efficiency, especially in terms of the number of robots deployed in more complex…

In this paper, we provide the first investigation into adaptive combinatorial experimental design, focusing on the trade-off between regret minimization and statistical power in combinatorial multi-armed bandits (CMAB). While minimizing…