|
|
|
|
|
Alberto Policriti and Nicola Prezza
|
|
|
|
|
|
|
|
|
|
|
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kotaro Matsuda, Shuhei Denzumi and Kunihiko Sadakane
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however, the size of ZD...
ver más
|
|
|
|
|
|
|
|
|
|
|
Muhammed Oguzhan Külekci and Yasin Öztürk
Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non?prefix?free codes, where a code-word can be a prefix of other(s), and thus,...
ver más
|
|
|
|
|
|
|
|
|
|
Biowastes from the food industry can be applied as a usable material after appropriate treatment (i.e., agglomeration). Biowastes are materials that could have better properties if they are mixed. Brewery and oilseed wastes were compressed and evaluated ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sangkyun Lee and Jeonghyun Lee
Deep neural networks (DNNs) have been quite successful in solving many complex learning problems. However, DNNs tend to have a large number of learning parameters, leading to a large memory and computation requirement. In this paper, we propose a model c...
ver más
|
|
|
|
|
|