Related papers: New vertex reconstruction algorithms for CMS
In this note, we examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing…
A novel combination of data analysis techniques is proposed for the reconstruction of all tracks of primary charged particles, as well as of daughters of displaced vertices (decays, photon conversions, nuclear interactions), created in high…
Open-set object recognition aims to identify if an object is from a class that has been encountered during training or not. To perform open-set object recognition accurately, a key challenge is how to reduce the reliance on…
3D dense reconstruction refers to the process of obtaining the complete shape and texture features of 3D objects from 2D planar images. 3D reconstruction is an important and extensively studied problem, but it is far from being solved. This…
We propose a framework for the joint inference of network topology, multi-type interaction kernels, and latent type assignments in heterogeneous interacting particle systems from multi-trajectory data. This learning task is a challenging…
A novel information-theoretic method for reconstruction of interaction networks is introduced. We prove that the method is exact for some class of networks. Performance tests on large synthetic transcriptional regulatory networks produce…
Mixture models are well-established learning approaches that, in computer vision, have mostly been applied to inverse or ill-defined problems. However, they are general-purpose divide-and-conquer techniques, splitting the input space into…
This paper provides a detailed description of a vertex fitting algorithm designed for precision measurements in low-energy particle physics experiments. An accurate reconstruction of low-momentum trajectories is facilitated by reducing the…
A new higher-order accurate method is proposed that combines the advantages of the classical $p$-version of the FEM on body-fitted meshes with embedded domain methods. A background mesh composed by higher-order Lagrange elements is used.…
We introduce $Recursive~Jigsaw~Reconstruction$, a technique for analyzing reconstructed particle interactions in the presence of kinematic and combinatoric unknowns associated with unmeasured and indistinguishable particles, respectively.…
Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum…
The complexity of linear mixed-effects (LME) models means that traditional diagnostics are rendered less effective. This is due to a breakdown of asymptotic results, boundary issues, and visible patterns in residual plots that are…
A particle flow event-reconstruction algorithm has been successfully deployed in the CMS experiment and is nowadays used by most of the analyses. It aims at identifying and reconstructing individually each particle arising from the LHC…
A track finding algorithm has been developed for reconstruction of e+e- pairs. It combines the information of the electromagnetic calorimeter with the information provided by the Tracker. Results on reconstruction efficiency of converted…
Many models beyond the Standard Model predict light and feebly interacting particles that are often long-lived. These long-lived particles (LLPs) in many cases can be produced from meson decays. In this work, we propose a simple and quick…
Many recent efforts at the LHC have been made to search for new particles that do not decay promptly but are instead long-lived. This has been done via many different exotic signatures, including searches performed at ATLAS for displaced…
In this paper, we propose a novel geometric model fitting method, called Mode-Seeking on Hypergraphs (MSH),to deal with multi-structure data even in the presence of severe outliers. The proposed method formulates geometric model fitting as…
Visual Language Models (VLMs) are now increasingly being merged with Large Language Models (LLMs) to enable new capabilities, particularly in terms of improved interactivity and open-ended responsiveness. While these are remarkable…
Building particle tracks is the most computationally intense step of event reconstruction at the LHC. With the increased instantaneous luminosity and associated increase in pileup expected from the High-Luminosity LHC, the computational…
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…