default search action
Hiroshi Sakamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j18]Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I
, Kilho Shin
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption. Algorithms 15(7): 229 (2022) - [i17]Keita Nonaka, Kazutaka Yamanouchi, Tomohiro I, Tsuyoshi Okita, Kazutaka Shimada, Hiroshi Sakamoto:
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation. CoRR abs/2202.13590 (2022) - 2021
- [i16]Shinji Ono, Jun Takata, Masaharu Kataoka, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Privacy-Preserving Multiparty Protocol for Feature Selection Problem. CoRR abs/2110.05088 (2021) - 2020
- [c45]Travis Gagie
Practical Random Access to SLP-Compressed Texts. SPIRE 2020: 221-231 - [c44]Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Faster Privacy-Preserving Computation of Edit Distance with Moves. WALCOM 2020: 308-320
2010 – 2019
- 2019
- [c43]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. DCC 2019: 518-527 - [c42]Travis Gagie
Rpair: Rescaling RePair with Rsync. SPIRE 2019: 35-44 - [i15]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Yoshimasa Takabatake:
Rpair: Rescaling RePair with Rsync. CoRR abs/1906.00809 (2019) - [i14]Travis Gagie, Tomohiro I, Giovanni Manzini, Gonzalo Navarro, Hiroshi Sakamoto, Louisa Seelbach Benkner, Yoshimasa Takabatake:
Tree-Shape Grammars for Random Access. CoRR abs/1910.07145 (2019) - [i13]Yohei Yoshimoto, Masaharu Kataoka, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Faster Privacy-Preserving Computation of Edit Distance with Moves. CoRR abs/1911.10719 (2019) - 2018
- [j17]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Approximate Frequent Pattern Discovery in Compressed Space. IEICE Trans. Inf. Syst. 101-D(3): 593-601 (2018) - [j16]Tatsuya Ohno, Kensuke Sakai, Yoshimasa Takabatake
A faster implementation of online RLBWT and its application to LZ77 parsing. J. Discrete Algorithms 52-53: 18-28 (2018) - [c41]Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression. IWOCA 2018: 323-335 - [c40]Shunta Nakagawa, Tokio Sakamoto, Yoshimasa Takabatake, Tomohiro I, Kilho Shin, Hiroshi Sakamoto:
Privacy-Preserving String Edit Distance with Moves. SISAP 2018: 226-240 - [i12]Kensuke Sakai, Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
RePair in Compressed Space and Time. CoRR abs/1811.01472 (2018) - 2017
- [c39]Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Space-Optimal Grammar Compression. ESA 2017: 67:1-67:15 - [c38]Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. IWOCA 2017: 409-419 - [i11]Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform. CoRR abs/1704.05233 (2017) - 2016
- [j15]Yoshimasa Takabatake, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Hiroshi Sakamoto
siEDM: An Efficient String Index and Search Algorithm for Edit Distance with Moves. Algorithms 9(2): 26 (2016) - [j14]Koichi Marumo, Shinichi Yamagiwa
Lazy Management for Frequency Table on Hardware-Based Stream Lossless Data Compression. Inf. 7(4): 63 (2016) - [c37]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Online Grammar Compression for Frequent Pattern Discovery. ICGI 2016: 93-104 - [i10]Yoshimasa Takabatake, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Hiroshi Sakamoto:
siEDM: an efficient string index and search algorithm for edit distance with moves. CoRR abs/1602.06688 (2016) - [i9]Shouhei Fukunaga, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto:
Online Grammar Compression for Frequent Pattern Discovery. CoRR abs/1607.04446 (2016) - 2015
- [c36]Shinichi Yamagiwa, Koichi Marumo, Hiroshi Sakamoto:
Stream-Based Lossless Data Compression Hardware Using Adaptive Frequency Table Management. BPOE 2015: 133-146 - [c35]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Self-Indexed Grammar Compression. SPIRE 2015: 258-269 - [i8]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Self-Indexed Grammar Compression. CoRR abs/1507.00805 (2015) - 2014
- [j13]Masayoshi Tanaka, Hiroshi Sakamoto, Mitsuo Kobayashi, Yukiharu Kitayama:
Estimation of unwanted spurious domain emissions from a multicarrier transmitter. IEEE Trans. Aerosp. Electron. Syst. 50(3): 2293-2303 (2014) - [c34]Hiroshi Sakamoto:
Grammar Compression: Grammatical Inference by Compression and Its Application to Real Data. ICGI 2014: 3-20 - [c33]Yoshinobu Kawahara
Workshop on Graph-Based Algorithms for Big Data and Its Applications (GABA2014). JSAI-isAI Workshops 2014: 293-295 - [c32]Koji Maeda, Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Finding Ambiguous Patterns on Grammar Compressed String. JSAI-isAI Workshops 2014: 331-339 - [c31]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Pattern Matching for String Edit Distance with Moves. SPIRE 2014: 203-214 - [c30]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Improved ESP-index: A Practical Self-index for Highly Repetitive Texts. SEA 2014: 338-350 - [i7]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Improved ESP-index: a practical self-index for highly repetitive texts. CoRR abs/1404.4972 (2014) - [i6]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Pattern Matching for String Edit Distance with Moves. CoRR abs/1408.0467 (2014) - 2013
- [j12]Masaya Nakahara, Shirou Maruyama, Tetsuji Kuboyama
Scalable Detection of Frequent Substrings by Grammar-Based Compression. IEICE Trans. Inf. Syst. 96-D(3): 457-464 (2013) - [j11]Tomohiro Kinjo, Yuji Koseki
Identification of Compounds with Potential Antibacterial Activity against Mycobacterium through Structure-Based Drug Screening. J. Chem. Inf. Model. 53(5): 1200-1212 (2013) - [j10]Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto:
ESP-index: A compressed index based on edit-sensitive parsing. J. Discrete Algorithms 18: 100-112 (2013) - [c29]Shinichi Yamagiwa, Hiroshi Sakamoto:
A reconfigurable stream compression hardware based on static symbol-lookup table. IEEE BigData 2013: 86-93 - [c28]Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto:
A Succinct Grammar Compression. CPM 2013: 235-246 - [c27]Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane
Fully-Online Grammar Compression. SPIRE 2013: 218-229 - [i5]Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto:
A Succinct Grammar Compression. CoRR abs/1304.0917 (2013) - 2012
- [j9]Shirou Maruyama, Hiroshi Sakamoto
An Online Algorithm for Lightweight Grammar-Based Compression. Algorithms 5(2): 214-235 (2012) - [j8]Yushi Nakamura, Toshihiko Horiike, Tetsuji Kuboyama
Extracting research communities from bibliographic data. Int. J. Knowl. Based Intell. Eng. Syst. 16(1): 25-34 (2012) - [c26]Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Variable-Length Codes for Space-Efficient Grammar-Based Compression. SPIRE 2012: 398-410 - 2011
- [c25]Shirou Maruyama, Masayuki Takeda, Masaya Nakahara, Hiroshi Sakamoto:
An Online Algorithm for Lightweight Grammar-Based Compression. CCP 2011: 19-28 - [c24]Masaya Nakahara, Shirou Maruyama, Tetsuji Kuboyama
Scalable Detection of Frequent Substrings by Grammar-Based Compression. Discovery Science 2011: 236-246 - [c23]Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto:
ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing. SPIRE 2011: 398-409 - [i4]Naoya Kishiue, Masaya Nakahara, Shirou Maruyama, Hiroshi Sakamoto:
A Searchable Compressed Edit-Sensitive Parsing. CoRR abs/1101.0080 (2011) - [i3]Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda:
Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 (2011) - 2010
- [j7]Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching. IEICE Trans. Inf. Syst. 93-D(2): 219-226 (2010) - [c22]Yushi Nakamura, Toshihiko Horiike, Yoshimasa Taira, Hiroshi Sakamoto:
An Improved Algorithm for Extracting Research Communities from Bibliographic Data. DASFAA Workshops 2010: 338-345
2000 – 2009
- 2009
- [j6]Hiroshi Sakamoto, Shirou Maruyama, Takuya Kida, Shinichi Shimozono:
A Space-Saving Approximation Algorithm for Grammar-Based Compression. IEICE Trans. Inf. Syst. 92-D(2): 158-165 (2009) - [c21]Toshihiko Horiike, Youhei Takahashi, Tetsuji Kuboyama
Extracting Research Communities by Improved Maximum Flow Algorithm. KES (2) 2009: 472-479 - 2008
- [c20]Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching. SPIRE 2008: 27-38 - [i2]Hiroshi Sakamoto:
A Space-Saving Approximation Algorithm for Grammar-Based Compression. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j5]Hiroshi Sakamoto:
Data grid deployment for high energy physics in Japan. Comput. Phys. Commun. 177(1-2): 239-242 (2007) - 2006
- [c19]Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto:
Improving Time and Space Complexity for Compressed Pattern Matching. ISAAC 2006: 484-493 - 2005
- [j4]Hiroshi Sakamoto:
A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms 3(2-4): 416-430 (2005) - [c18]Tetsuya Maita, Hiroshi Sakamoto:
A simple extension of queriable compression for XML data. AMT 2005: 91-95 - 2004
- [j3]Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Trans. Inf. Syst. 87-D(12): 2754-2763 (2004) - [c17]Hiroshi Sakamoto, Takuya Kida, Shinichi Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression. SPIRE 2004: 218-229 - 2003
- [j2]Hiroshi Sakamoto, Kouichi Hirata
Learning elementary formal systems with queries. Theor. Comput. Sci. 298(1): 21-50 (2003) - [c16]Hiroshi Sakamoto:
A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression. CPM 2003: 348-360 - [i1]Atsushi Manabe
A data Grid testbed environment in Gigabit WAN with HPSS. CoRR cs.DC/0306051 (2003) - 2002
- [c15]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Data Mining from Large Text Databases. Progress in Discovery Science 2002: 123-139 - [c14]Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Knowledge Discovery from Semistructured Texts. Progress in Discovery Science 2002: 586-599 - [c13]Tatsuya Asai, Kenji Abe, Shinji Kawasoe, Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Substructure Discovery from Large Semi-structured Data. SDM 2002: 158-174 - 2001
- [c12]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Learning of Semi-structured Data from Queries. ALT 2001: 315-331 - [c11]Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Discovery of Proximity Patterns with Suffix Arrays. CPM 2001: 152-156 - [c10]Katsuaki Taniguchi, Hiroshi Sakamoto, Hiroki Arimura, Shinichi Shimozono, Setsuo Arikawa:
Mining Semi-structured Data by Path Expressions. Discovery Science 2001: 378-388 - [c9]Kouichi Hirata
Prediction-Preserving Reducibility with Membership Queries on Formal Languages. FCT 2001: 172-183 - [c8]Hiroshi Sakamoto, Yoshitsugu Murakami, Hiroki Arimura, Setsuo Arikawa:
Extracting Partial Structures from HTML Documents. FLAIRS 2001: 264-268 - 2000
- [j1]Hiroshi Sakamoto, Daisuke Ikeda:
Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2): 297-308 (2000) - [c7]Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa:
Identification of Tree Translation Rules from Examples. ICGI 2000: 241-255 - [c6]Hiroki Arimura, Hiroshi Sakamoto, Setsuo Arikawa:
Learning Term Rewriting Systems from Entailment . ILP Work-in-progress reports 2000 - [c5]Hiroki Arimura, Jun-ichiro Abe, Hiroshi Sakamoto, Setsuo Arikawa, Ryoichi Fujino, Shinichi Shimozono:
Text Data Mining: Discovery of Important Keywords in the Cyberspace. Kyoto International Conference on Digital Libraries 2000: 121-126
1990 – 1999
- 1998
- [c4]Hiroshi Sakamoto:
Finding a One-Variable Pattern from Incomplete Data. ALT 1998: 234-246 - [c3]Hiroshi Sakamoto, Daisuke Ikeda:
Intractability of Decision Problems for Finite-Memory Automata. MCU (2) 1998: 58-74 - 1997
- [c2]Hiroshi Sakamoto:
Learning Simple Deterministic Finite-Memory Automata. ALT 1997: 416-431 - 1995
- [c1]Hiroshi Sakamoto:
Language Learning from Membership Queries and Characteristic Examples. ALT 1995: 55-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: