Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Tabei, Yasuo"'
Autor:
Nishimoto, Takaaki, Tabei, Yasuo
Big data, encompassing extensive datasets, has seen rapid expansion, notably with a considerable portion being textual data, including strings and texts. Simple compression methods and standard data structures prove inadequate for processing these da
Externí odkaz:
http://arxiv.org/abs/2404.07510
Improvements in tracking technology through optical and computer vision systems have enabled a greater understanding of the movement-based behaviour of multiple agents, including in team sports. In this study, a Multi-Agent Statistically Discriminati
Externí odkaz:
http://arxiv.org/abs/2311.16564
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 these strings have been proposed thus far. Among them, an efficient com
Externí odkaz:
http://arxiv.org/abs/2202.07885
Autor:
Kanda, Shunsuke, Tabei, Yasuo
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) in the Hamming space. While traditional hashing techniques produce bina
Externí odkaz:
http://arxiv.org/abs/2009.11559
Autor:
Nishimoto, Takaaki, Tabei, Yasuo
Indexing highly repetitive strings (i.e., strings with many repetitions) for fast queries has become a central research topic in string processing, because it has a wide variety of applications in bioinformatics and natural language processing. Altho
Externí odkaz:
http://arxiv.org/abs/2006.05104
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 of trajectories is indispensable for turning these datasets into know
Externí odkaz:
http://arxiv.org/abs/2005.10917
Autor:
Nishimoto, Takaaki, Tabei, Yasuo
Enumerating characteristic substrings (e.g., maximal repeats, minimal unique substrings, and minimal absent words) in a given string has been an important research topic because there are a wide variety of applications in various areas such as string
Externí odkaz:
http://arxiv.org/abs/2004.01493
Autor:
Kanda, Shunsuke, Tabei, Yasuo
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 is called similarity-preserving hashing and approximates a similarity m
Externí odkaz:
http://arxiv.org/abs/1910.08278
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 implementation. When limited to static applications, there are a number of
Externí odkaz:
http://arxiv.org/abs/1906.06015
Autor:
Duy, Vo Nguyen Le, Sakuma, Takuto, Ishiyama, Taiju, Toda, Hiroki, Nishi, Kazuya, Karasuyama, Masayuki, Okubo, Yuta, Sunaga, Masayuki, Tabei, Yasuo, Takeuchi, Ichiro
We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less si
Externí odkaz:
http://arxiv.org/abs/1905.01788