We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
ABSTRACT. We consider a general family of regularized Navier-Stokes and Magnetohydrodynamics (MHD) models on n-dimensional smooth compact Riemannian manifolds with or without bound...
Michael Holst, Evelyn Lunasin, Gantumur Tsogtgerel
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
Morphological pattern spectra computed from granulometries are frequently used to classify the size classes of details in textures and images. An extension of this technique, whic...