|
|
|
|
|
Dominik Köppl
Although graph theory has already been introduced in spatial reasoning, current spatial database systems do not provide out-of-the-box routing on geometric points that are not matched on the graph. Methods that connect new reference locations to the grap...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai and Keisuke Goto
Re-Pairis a grammar compression scheme with favorably good compression rates. The computation of Re-Pair comes with the cost of maintaining large frequency tables, which makes it hard to compute Re-Pair on large-scale data sets. As a solution for this pr...
ver más
|
|
|
|
|
|