Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
The profit of a retail product not only comes from its own sales, but also comes from its influence on the sales of other products. How to promote the right products to the righ...
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
—In this paper, we present a near-lossless compression scheme for scalar-quantized source codec parameters based on iterative source-channel decoding (ISCD). The scheme is compar...
Laurent Schmalen, Peter Vary, Thorsten Clevorn, Ma...