739 search results - page 44 / 148 » Sorting Algorithms |
SIAMCOMP
2011
13 years 3 months ago
2011
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...
VTC
2006
IEEE
14 years 2 months ago
2006
IEEE
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...
ACL
2006
13 years 10 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
IPL
2002
13 years 8 months ago
2002
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...
ICIP
2007
IEEE
14 years 3 months ago
2007
IEEE
— 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...