|
|
|
|
|
Tamar Shabi, Yaron Ziv, Reuven Yosef and Nadav Shashar
Global degradation of coral reefs is reflected in the destruction of shelters in various environments and threatens the stability of marine ecosystems. Artificial shelters offer an alternative, but their design could be more challenging due to limited kn...
ver más
|
|
|
|
|
|
|
|
|
|
|
Assaf B. Spanier, Dor Steiner, Navon Sahalo, Yoel Abecassis, Dan Ziv, Ido Hefetz and Shimon Kimchi
Fingerprint analysis has long been a cornerstone in criminal investigations for suspect identification. Beyond this conventional role, recent efforts have aimed to extract additional demographic information from fingerprints, such as gender, age, and nat...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yaniv Shmuel, Yaron Ziv and Baruch Rinkevich
Canopies of branching corals harbor a wide range of sessile- and mobile-dwelling species that benefit from the physical compartments and the micro-environments created by the complex three-dimensional structures. Although different compartments within ca...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yaniv Shmuel, Yaron Ziv and Baruch Rinkevich
The three-dimensional structural complexities generated by living sessile organisms, such as trees and branching corals, embrace distinct communities of dwelling organisms, many of which are adapted to specific niches within the structure. Thus, characte...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a com...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present algorithms computing the non-overlapping Lempel?Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limite...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dmitry Kosolobov and Daniel Valenzuela
The Lempel-Ziv parsing (LZ77) is a widely popular construction lying at the heart of many compression algorithms. These algorithms usually treat the data as a sequence of bytes, i.e., blocks of fixed length 8. Another common option is to view the data as...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present linear-time algorithms computing the reversed Lempel?Ziv factorization [Kolpakov and Kucherov, TCS?09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-over...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shmuel T. Klein and Dana Shapira
It seems reasonable to expect from a good compression method that its output should not be further compressible, because it should behave essentially like random data. We investigate this premise for a variety of known lossless compression techniques, an...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhuo Xu, Josh W. Albrecht, Shreyas S. Kolapkar, Stas Zinchik and Ezra Bar-Ziv
This study provides a pathway to remove chlorine from the solid wastes, and to produce low-cost solid fuels with enhanced properties for power applications.
|
|
|
|
|
|