We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, ...
Abstract— This paper addresses Tomlinson-Harashima Precoding (THP) for the downlink of multiuser systems, where the transmitter is equipped with multiple antennas and each decent...
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...