Pregled bibliografske jedinice broj: 182754
AN EFFICIENT ALGORITHM FOR SAVING ORDERED SETS IN A COMPACTED FORM
AN EFFICIENT ALGORITHM FOR SAVING ORDERED SETS IN A COMPACTED FORM // International journal of computer mathematics, 34 (1990), 1; 65-70 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 182754 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
AN EFFICIENT ALGORITHM FOR SAVING ORDERED SETS IN A COMPACTED FORM
Autori
Essert, Mario
Izvornik
International journal of computer mathematics (0020-7160) 34
(1990), 1;
65-70
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Compression; factorial base; ordered sets.
Sažetak
Although developed for saving the large number of lines that occur in the construction of biplanes, the algorithm described in this article has a general significance. The algorithm takes any set of ordered elements and converts it into an array of symbols based on a number system with a factorial base. This array is then partitioned and saved as one or more numbers. In this way a saving of more than 50% can be achieved.
Izvorni jezik
Engleski
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- SCI-EXP, SSCI i/ili A&HCI
