Related papers: Sequential recombination algorithm for jet cluster…
The classification of events involving jets as signal-like or background-like can depend strongly on the jet algorithm used and its parameters. This is partly due to the fact that standard jet algorithms yield a single partition of the…
We briefly describe a new general algorithm for carrying out QCD calculations to next-to-leading order in perturbation theory. The algorithm can be used for computing arbitrary jet cross sections in arbitrary processes and can be…
Drone detection has become an essential task in object detection as drone costs have decreased and drone technology has improved. It is, however, difficult to detect distant drones when there is weak contrast, long range, and low…
While supervised object detection and segmentation methods achieve impressive accuracy, they generalize poorly to images whose appearance significantly differs from the data they have been trained on. To address this when annotating data is…
We present a new approach to jet definition alternative to clustering methods, such as the anti-$k_T$ scheme, that exploit kinematic data directly. Instead the new method uses kinematic information to represent the particles in a…
In this article we show that the reconstructions of semiconductor surfaces can be determined using a genetic procedure. Coupled with highly optimized interatomic potentials, the present approach represents an efficient tool for finding and…
This paper introduces a new Monte Carlo algorithm to invert large matrices. It is based on simultaneous coupled draws from two random vectors whose covariance is the required inverse. It can be considered a generalization of a previously…
Background subtraction is a fundamental pre-processing task in computer vision. This task becomes challenging in real scenarios due to variations in the background for both static and moving camera sequences. Several deep learning methods…
We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory…
Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…
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…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
Unmanned aerial vehicles (UAVs) are widely used due to their low cost and versatility, but they also pose security and privacy threats. Therefore, reliable detection for low-altitude UAVs is an important issue. The strong ground clutter…
Reconstructing the trajectories of charged particles from the collection of hits they leave in the detectors of collider experiments like those at the Large Hadron Collider (LHC) is a challenging combinatorics problem and computationally…
We consider the mass distribution of QCD jets after the application of jet substructure methods, specifically the mass-drop tagger, pruning, trimming and their variants. In contrast to most current studies employing Monte Carlo methods, we…
We present a detailed analysis of a new, iterative density reconstruction algorithm. This algorithm uses a decreasing smoothing scale to better reconstruct the density field in Lagrangian space. We implement this algorithm to run on the…
I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class,…
Sequential Monte Carlo methods are typically not straightforward to implement on parallel architectures. This is because standard resampling schemes involve communication between all particles. The $\alpha$-sequential Monte Carlo method was…
In this paper, by combining the algorithm New Q-Newton's method - developed in previous joint work of the author - with Armijo's Backtracking line search, we resolve convergence issues encountered by Newton's method (e.g. convergence to a…
We propose the Bi-Event Subtraction Technique (BEST) as a method of modeling and subtracting large portions of the combinatoric background during reconstruction of particle decay chains at hadron colliders. The combinatoric background…