Related papers: New vertex reconstruction algorithms for CMS
This note presents an overview of current and potential future applications of machine-learning-based techniques in the study of the top quark. The research community has developed a diverse set of ideas and tools, including algorithms for…
In this chapter, we discuss recent advances and new opportunities through methods of machine learning for the field of classical density functional theory, dealing with the equilibrium properties of thermal nano- and micro-particle systems…
Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…
Quantum Computing is a rapidly developing field with the potential to tackle the increasing computational challenges faced in high-energy physics. In this work, we explore the potential and limitations of variational quantum algorithms in…
Many Standard Model extensions predict metastable massive particles that can be detected by looking for displaced decay vertices in the inner detector volume. Current approaches to search for these events in high-energy particle collisions…
A large fraction of the results produced by the LHC experiments during the first run were made possible by precision vertexing detectors. The all-silicon tracking detector of the CMS experiment uses a pixel detector to do vertexing. This…
Inverse problems are inherently ill-posed, suffering from non-uniqueness and instability. Classical regularization methods provide mathematically well-founded solutions, ensuring stability and convergence, but often at the cost of reduced…
This manuscript provides a comprehensive review of the Maximum Clique Problem, a computational problem that involves finding subsets of vertices in a graph that are all pairwise adjacent to each other. The manuscript covers in a simple way…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
The high-luminosity era of the LHC will offer greatly increased number of events for more precise Standard Model measurements and Beyond Standard Model searches, but will also pose unprecedented challenges to the detectors. To meet these…
We aim at the solution of inverse problems in imaging, by combining a penalized sparse representation of image patches with an unconstrained smooth one. This allows for a straightforward interpretation of the reconstruction. We formulate…
In high-energy particle collisions, the reconstruction of secondary vertices from heavy-flavour hadron decays is crucial for identifying and studying jets initiated by $b$- or $c$-quarks. Traditional methods, while effective, require…
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…
The tau identification and reconstruction algorithms developed for the LHC experiments Atlas and CMS are presented. Reconstruction methods suitable for use at High Level Trigger and off-line are described in detail
Complex networks datasets often come with the problem of missing information: interactions data that have not been measured or discovered, may be affected by errors, or are simply hidden because of privacy issues. This Element provides an…
Search for BSM phenomena is one of the fundamental goals of the LHC experiments. Many BSM models foresee long-lived particles which decay far from the production vertex and a big effort has been done both by the ATLAS and CMS collaborations…
The graph retrieval problem is to search in a large corpus of graphs for ones that are most similar to a query graph. A common consideration for scoring similarity is the maximum common subgraph (MCS) between the query and corpus graphs,…
Feedback Vertex Set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic. From the point of view of parameterized algorithms and fixed-parameter…
The cross-depiction problem is that of recognising visual objects regardless of whether they are photographed, painted, drawn, etc. It is a potentially significant yet under-researched problem. Emulating the remarkable human ability to…
Numerical lattice quantum chromodynamics studies of the strong interaction are important in many aspects of particle and nuclear physics. Such studies require significant computing resources to undertake. A number of proposed methods…