62 search results - page 13 / 13 » Modified bar recursion |
IPL
2002
13 years 4 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...
TASLP
2002
13 years 4 months ago
2002
In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case whe...