The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
—Hyperbolic position bounding (HPB) provides a mechanism to probabilistically delimit the location of a wireless network malicious insider to a candidate area. A large scale path...
— The average of the product of two Gaussian Q-functions having arguments as different scaled versions of the same Nakagami distributed fading gain magnitude is derived in close...
The tradeoffs between ballistic imaging (time-gated imaging of first-arrival, unscattered photons) and conventional imaging for resolving tumors in biological scattering media ar...