๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved phase-splitting algorithm

โœ Scribed by F.F.Y. Walraven; P.V. Van Rompay

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
615 KB
Volume
12
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved LLL algorithm
An improved LLL algorithm
โœ Franklin T. Luk; Daniel M. Tracy ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation

An improved Shellsort algorithm
An improved Shellsort algorithm
โœ Liu Renren ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

Shellsort algorithm is a refinement of the straight insertion soIt. Each pass of this method sorts all items which are h-position apart by straight insertion sort, and the place of the item to be inserted in is determined by comparing items which are already ordered from right to left. In this pape

An improved block-interchange algorithm
An improved block-interchange algorithm
โœ John L Mohammed; Carlos S Subi ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 487 KB
An improved adaptive string searching al
An improved adaptive string searching algorithm
โœ Z. Liu; X. Du; N. Ishi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 56 KB

Sunday's OM algorithm can reduce the number of character comparisons by making use of information of character distribution in an alphabet. Smith's adaptive algorithm uses dynamic statistics to reduce comparisons, and its performance is close to that of the OM algorithm in the number of character co