Related papers: The SISCone jet algorithm optimised for low partic…
The Phase-2 Upgrade of the CMS Level-1 Trigger (L1T) will reconstruct particles using the Particle Flow algorithm, connecting information from the tracker, muon, and calorimeter detectors, and enabling fine-grained reconstruction of high…
In collider physics, jet algorithms are a ubiquitous tool for clustering particles into discrete jet objects. Event shapes offer an alternative way to characterize jets, and one can define a jet multiplicity event shape, which can take on…
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a J_{E_T} function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller…
We propose a new search strategy for high-multiplicity hadronic final states. When new particles are produced at threshold, the distribution of their decay products is approximately isotropic. If there are many partons in the final state,…
An infrared and collinear (IRC) safe definition of the partonic flavour of a jet is vital for precision predictions of quantum chromodynamics at colliders. Jet flavour definitions have been presented in the literature, but they are…
A jet algorithm based on the k-means clustering procedure is proposed which can be used for the invariant-mass reconstruction of heavy states decaying to hadronic jets. The proposed algorithm was tested by reconstructing E+ E- to ttbar to 6…
This talk reviews some key developments that have taken place in hadron-collider jet finding over the past couple of years, including: technical advances such as the complete formulation of an infrared safe seedless cone algorithm and fast…
Jet grooming algorithms are widely used in experimental analyses at hadron colliders to remove contaminating radiation from within jets. While the algorithms perform a great service to the experiments, their intricate algorithmic structure…
Sparse Subspace Clustering (SSC) has achieved state-of-the-art clustering quality by performing spectral clustering over a $\ell^{1}$-norm based similarity graph. However, SSC is a transductive method which does not handle with the data not…
Conventional jet algorithms are based on a deterministic view of the underlying hard scattering process. Each outgoing parton from the hard scattering is associated with a hard, well separated jet. This approach is very successful because…
Recent developments in jet clustering are reviewed. We present a list of fast and infrared and collinear safe algorithms, and also describe new tools like jet areas. We show how these techniques can be applied to the study of underlying…
We review recent developments related to jet clustering algorithms and jet finding. These include fast implementations of sequential recombination algorithms, new IRC safe algorithms, quantitative determination of jet areas and quality…
Under which conditions does a jet appear as a particle--like signal from the hidden realm of quarks and gluons? Motivated by this question jet clustering conditions are formulated, in order to characterize jet clustering algorithms, which…
This paper considers a downlink ultra-dense heterogeneous cloud radio access network (H-CRAN) which guarantees seamless coverage and can provide high date rates. In order to reduce channel state information (CSI) feedback overhead,…
We review recent developments related to jet clustering algorithms and jet reconstruction, with particular emphasis on their implications in heavy ion collisions. These developments include fast implementations of sequential recombination…
We investigate single-inclusive high-pT jet production in longitudinally polarized pp collisions at RHIC, with particular focus on the algorithm adopted to define the jets. Following and extending earlier work in the literature, we treat…
Subspace clustering (SC) is a popular method for dimensionality reduction of high-dimensional data, where it generalizes Principal Component Analysis (PCA). Recently, several methods have been proposed to enhance the robustness of PCA and…
We investigate a new sequential recombination algorithm which effectively subtracts background as it reconstructs the jet. We examine the new algorithm's behavior in light of existing algorithms, and we find that in Monte Carlo comparisons,…
We present a next-to-leading order QCD calculation for the single-inclusive production of collimated jets at hadron colliders, when the jet is defined by maximizing a suitable jet function that depends on the momenta of final-state…
This paper presents an architecture-friendly k-means clustering algorithm called SIVF for a large-scale and high-dimensional sparse data set. Algorithm efficiency on time is often measured by the number of costly operations such as…