default search action
Yoshifumi Sakai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c34]Yoshifumi Sakai:
A Data Structure for the Maximum-Sum Segment Problem with Offsets. CPM 2024: 26:1-26:15 - 2023
- [j16]Miyuji Hirota, Yoshifumi Sakai:
A Fast Algorithm for Finding a Maximal Common Subsequence of Multiple Strings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1191-1194 (2023) - [i4]Miyuji Hirota, Yoshifumi Sakai:
Efficient algorithms for enumerating maximal common subsequences of two strings. CoRR abs/2307.10552 (2023) - [i3]Tomoya Shiba, Akinobu Mizutani
, Yuga Yano, Tomohiro Ono, Shoshi Tokuno, Daiju Kanaoka, Yukiya Fukuda, Hayato Amano, Mayu Koresawa, Yoshifumi Sakai, Ryogo Takemoto, Katsunori Tamai, Kazuo Nakahara, Hiroyuki Hayashi, Satsuki Fujimatsu, Yusuke Mizoguchi, Moeno Anraku, Mayo Suzuka, Lu Shen, Kohei Maeda, Fumiya Matsuzaki, Ikuya Matsumoto, Kazuya Murai, Kosei Isomoto, Kim Minje, Yuichiro Tanaka, Takashi Morie, Hakaru Tamukoh:
Hibikino-Musashi@Home 2023 Team Description Paper. CoRR abs/2310.12650 (2023) - 2022
- [j15]Yoshifumi Sakai, Shunsuke Inenaga
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Algorithmica 84(9): 2581-2596 (2022) - [j14]Yoshifumi Sakai:
A data structure for substring-substring LCS length queries. Theor. Comput. Sci. 911: 41-54 (2022) - [i2]Tomoya Shiba, Tomohiro Ono, Shoshi Tokuno, Issei Uchino, Masaya Okamoto, Daiju Kanaoka, Kazutaka Takahashi, Kenta Tsukamoto, Yoshiaki Tsutsumi, Yugo Nakamura, Yukiya Fukuda, Yusuke Hoji, Hayato Amano, Yuma Kubota, Mayu Koresawa, Yoshifumi Sakai, Ryogo Takemoto, Katsunori Tamai, Kazuo Nakahara, Hiroyuki Hayashi, Satsuki Fujimatsu, Akinobu Mizutani
Hibikino-Musashi@Home 2022 Team Description Paper. CoRR abs/2211.06696 (2022) - 2020
- [c33]Yoshifumi Sakai, Shunsuke Inenaga:
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ISAAC 2020: 6:1-6:16 - [i1]Yoshifumi Sakai, Shunsuke Inenaga:
A reduction of the dynamic time warping distance to the longest increasing subsequence length. CoRR abs/2005.09169 (2020)
2010 – 2019
- 2019
- [j13]Yoshifumi Sakai:
A substring-substring LCS data structure. Theor. Comput. Sci. 753: 16-34 (2019) - [j12]Yoshifumi Sakai:
Maximal common subsequence algorithms. Theor. Comput. Sci. 793: 132-139 (2019) - 2018
- [j11]Yoshifumi Sakai:
A Maximal Local Maximum-Sum Segment Data Structure. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1541-1542 (2018) - [c32]Yoshifumi Sakai:
Maximal Common Subsequence Algorithms. CPM 2018: 1:1-1:10 - 2016
- [c31]Yoshifumi Sakai:
A Linear-Space Algorithm for the Substring Constrained Alignment Problem. SPIRE 2016: 15-21 - 2012
- [j10]Yoshifumi Sakai:
A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(1): 354-361 (2012) - [c30]Yoshifumi Sakai:
Computing the Longest Common Subsequence of Two Run-Length Encoded Strings. ISAAC 2012: 197-206 - 2011
- [j9]Yoshifumi Sakai:
A fast algorithm for multiplying min-sum permutations. Discret. Appl. Math. 159(17): 2175-2183 (2011) - [j8]Yoshifumi Sakai:
An Almost Quadratic Time Algorithm for Sparse Spliced Alignment. Theory Comput. Syst. 48(1): 189-210 (2011) - [c29]Yoshifumi Sakai:
A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria. ISAAC 2011: 663-672
2000 – 2009
- 2009
- [j7]Yoshifumi Sakai:
Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence. Theor. Comput. Sci. 410(27-29): 2759-2766 (2009) - 2006
- [j6]Yoshifumi Sakai:
A linear space algorithm for computing a longest common increasing subsequence. Inf. Process. Lett. 99(5): 203-207 (2006) - 2005
- [j5]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
Evaluations of Freshness Considering Scoring on Fresh Information Retrieval. J. Interconnect. Networks 6(3): 265-282 (2005) - [c28]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
The Evaluations of FTF-IDF Scoring for Fresh Information Retrieval. AINA 2005: 635-640 - [c27]Minoru Uehara, Nobuyoshi Sato, Yoshifumi Sakai:
Adaptive Calculation of Scores for Fresh Information Retrieval. ICPADS (1) 2005: 750-755 - [c26]Minoru Uehara, Nobuyoshi Sato, Yoshifumi Sakai:
Adaptive Scoring Method based on Freshness for Fresh Information Retrieval. WIRI 2005: 226-231 - 2004
- [c25]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
FTF · IDF Scoring for Fresh Information Retrieval. AINA (1) 2004: 165-170 - [c24]Minoru Udagawa, Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
Distributed Pipelining Processing for Index Updating Method. AINA (2) 2004: 489-492 - [c23]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai:
Searching Restricted Documents in a Cooperative Search Engine. ICDCS Workshops 2004: 44-49 - [c22]Minoru Udagawa, Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
Distributed Index Updating Method for Intranet Information Retrieval. ICDCS Workshops 2004: 56-61 - 2003
- [c21]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Redundancy of Meta Search Servers in a Distributed Search Engine. AINA 2003: 400-407 - [c20]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
Temporal Information Retrieval in Cooperative Search Engine. DEXA Workshops 2003: 215-220 - [c19]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
A Scalable Distributed Search Engine for Fresh Information Retrieval. ICWI 2003: 877-880 - [c18]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Query Based Site Selection for Distributed Search Engines. ICDCS Workshops 2003: 556-561 - [c17]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
A Scalable Distributed Search Engine for Intranet Information Retrieval. ICEIS (1) 2003: 562-565 - [c16]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai:
Temporal ranking for fresh information retrieval. IRAL 2003: 116-123 - [c15]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai:
Reliability of a Distributed Search Engine for Fresh Information Retrieval in Large-Scale Intranet. ISPA 2003: 14-27 - 2002
- [c14]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Reliable Distributed Search Engine Based on Multiple Meta Servers. CW 2002: 79-84 - [c13]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Persistent Cache in a Distributed Search Engine. DEXA Workshops 2002: 54-58 - [c12]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Persistent Cache in Cooperative Search Engine. ICDCS Workshops 2002: 182-190 - [c11]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Fresh Information Retrieval Using Cooperative Meta Search Engines. ICOIN (2) 2002: 656-670 - [c10]Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Scalability and Reliability in a Distributed Search Engine. ICPADS 2002: 57-62 - [c9]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
On Updating in Very Short Time by Distributed Search Engines. SAINT 2002: 176-185 - 2001
- [c8]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
A Distributed Search Engine for Fresh Information Retrieval. DEXA Workshop 2001: 211-216 - [c7]Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, Hideki Mori:
Distributed Information Retrieval by Using Cooperative Meta Search Engines. ICDCS Workshops 2001: 345-350 - 2000
- [j4]Yoshifumi Sakai, Akira Maruoka:
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. Theory Comput. Syst. 33(1): 17-33 (2000) - [j3]Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
The learnability of exclusive-or expansions based on monotone DNF formulas. Theor. Comput. Sci. 241(1-2): 37-50 (2000)
1990 – 1999
- 1999
- [j2]Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka:
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions. Inf. Comput. 152(2): 188-204 (1999) - 1997
- [j1]Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai:
Learning Orthogonal F-Horn Formulas. Theor. Comput. Sci. 185(1): 177-190 (1997) - 1996
- [c6]Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
Learnability of Exclusive-Or Expansion Based on Monotone DNF Formulas. ALT 1996: 12-25 - 1995
- [c5]Akira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka:
Learning Orthogonal F-Horn Formulas. ALT 1995: 110-122 - [c4]Yoshifumi Sakai, Eiji Takimoto, Akira Maruoka:
Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions. COLT 1995: 206-213 - 1994
- [c3]Yoshifumi Sakai, Akira Maruoka:
Learning Monotone Log-Term DNF Formulas. COLT 1994: 165-172 - 1992
- [c2]Yoshifumi Sakai, Akira Maruoka:
Learning k-Term Monotone Boolean Formulae. ALT 1992: 197-207 - 1991
- [c1]Yoshifumi Sakai:
The logic of molecular geneticists for the understanding of genetic information. ALT 1991: 3-5
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-12-10 20:52 CET 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: