1 citations · 2 across the 3 of their papers we have counts for
5 papers
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space
Takaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei
The compression of highly repetitive strings (i.e., strings with many repetitions) has been a central research topic in string processing, and quite a few compression methods for t…
Dynamic Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Similarity-preserving hashing is a core technique for fast similarity searches, and it randomly maps data points in a metric space to strings of discrete symbols (i.e., sketches) i…
Succinct Trit-array Trie for Scalable Trajectory Similarity Search
Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii +1
Massive datasets of spatial trajectories representing the mobility of a diversity of moving objects are ubiquitous in research and industry. Similarity search of a large collection…
-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping i…
Dynamic Path-Decomposed Tries
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2
A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…