Results 41 to 50 of about 165 (120)

A succinct string dictionary index in external memory

open access: yes, 2014
With the coming of the big data age, more and more string dictionaries need to be processed. The existing string dictionary indexes are either too space-consuming, or lack of locality of reference, making them inapplicable in the external memory ...
Zhang, Guangquan   +2 more
core  

A frequent max substring technique for Thai text indexing

open access: yes, 2011
This research details the development of a novel methodology, called the frequent max substring technique, for extracting indexing terms and constructing an index for Thai text documents.
Chumwatana, Todsanai
core  

Longest match string searching for Ziv-Lempel compression [PDF]

open access: yes, 1989
TR-COSC 06/89:Ziv-Lempel coding is currently one of the more practical data compression schemes. It operates by replacing a substring of a text with a pointer to its longest previous occurrence in the input, for each coding step.
Bell, T., Kulp, D.
core  

A Survey on the Integration of Blockchains and Databases. [PDF]

open access: yesData Sci Eng, 2023
Zhu C, Li J, Zhong Z, Yue C, Zhang M.
europepmc   +1 more source

Selection of algorithms and data structures for secure storage and processing of metadata in iot systems based on the Ethereum blockchain

open access: yes
У статті розглянуто теоретичні засади викоритання алгоритмів та структур даних для безпечного зберігання та обробки метаданих в IoT-системах із використанням блокчейну Ethereum.
Любчак, Володимир Олександрович   +1 more
core   +1 more source

Efficient text search in OpenStreetMap data on mobile devices

open access: yes, 2011
In dieser Arbeit sollen mehrere Möglichkeiten zur effizienten Textsuche in OpenStreetMap- Daten vorgestellt werden. Das Ziel ist ein Androidprogramm, mit welchem nach Zeichenketten in OpenStreetMap-Daten gesucht werden kann.
Bahrdt, Daniel
core   +1 more source

Asymmetric Renyi Problem

open access: yes, 2019
In 1960 Rényi, in his Michigan State University lectures, asked for the number of random queries necessary to recover a hidden bijective labelling of n distinct objects.
DRMOTA, M., SZPANKOWSKI, W., MAGNER, A.
core   +1 more source

Home - About - Disclaimer - Privacy