Related papers: On Building Better Cone Jet Algorithms

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

Studies of jet-shape observables in hard processes are summarized together with future developments

I review the recent theoretical progress towards the computation of jet observables at two loops in QCD.

Mass measurements of objects that decay into hadronic jets, such as the top quark, are shown to be improved by using a variant of the $k_t$ jet algorithm in place of standard cone algorithms. The possibility and importance of better…

In time for the first tests on LHC data we introduce a set of improvements and tests of purely kinematic top tagging algorithms. First, we show how different jet algorithms can be used for different transverse momentum regimes. Combining…

Understanding the convergence process of neural networks is one of the most complex and crucial issues in the field of machine learning. Despite the close association of notable successes in this domain with the convergence of artificial…

Many jet algorithms have been proposed in the past to study the hadronic final state in E+E-, EP and PP collisions. Here we review some of the most popular, mainly concentrating on the jet algorithms used at HERA and TEVATRON.

We review various aspects of jet physics in the context of hadron colliders. We start by discussing the definitions and properties of jets and recent development in this area. We then consider the question of factorization for processes…

In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…

This writeup highlights the infrared unsafety of the "midpoint" cone jet-algorithm and provides a brief overview of why this is a serious issue. It then shows how one can build a safe (seedless) cone algorithm and discusses the potential…

We discuss the motivation for making predictions for jet cross sections at next-to-next-to-leading order. We describe the theoretical ingredients needed for such a calculation and briefly review the progress in the field.

Error enhancement properties of data processing algorithms in elementary particle physics measurements are discussed. It is argued that a systematic use of continuous weights instead of hard cuts may reduce errors of the results at the cost…

Some recent developments in the theory of quantum spin systems are reviewed.

To precisely measure jets over a large background such as pile up in high luminosity p+p collisions at LHC, a new generation of jet reconstruction algorithms is developed. These algorithms are also applicable to reconstruct jets in the…

This report of the BOOST2012 workshop presents the results of four working groups that studied key aspects of jet substructure. We discuss the potential of the description of jet substructure in first-principle QCD calculations and study…

Standard jet finding techniques used in elementary particle collisions have not been successful in the high track density of heavy-ion collisions. This paper describes a modified cone-type jet finding algorithm developed for the complex…

Full jet reconstruction in heavy-ion collisions is expected to provide more sensitive measurements of jet quenching in hot QCD matter at RHIC. In this paper we review recent studies of jets utilizing modern jet reconstruction algorithms and…

Jet finding algorithms, as they are used in $e^+ e^-$ and hadron collisions, are reviewed and compared. It is suggested that a successive combination style algorithm, similar to that used in $e^+ e^-$ physics, might be useful also in hadron…

In this article, we review some of the complexities of jet algorithms and of the resultant comparisons of data to theory. We review the extensive experience with jet measurements at the Tevatron, the extrapolation of this acquired wisdom to…

Efficient network design, construction and analysis are important topics, considering the highly dynamic environment in which data communication occurs nowadays. In this paper we address several problems concerning these topics from an…