This is the top of the page.
Displaying present location in the site.
  1. Home
  2. About NEC
  3. Research & Development
  4. NEC R&D Members
  5. Satoshi Yoshida
Main content starts here.

NEC R&D Members

Satoshi Yoshida

Data Mining Technology Group
Data Science Research Laboratories
NEC Corporation
Ph.D.

Address:
1753, Shimonumabe, Nakahara-ku, Kawasaki-shi, Kanagawa, 211-8666, Japan

Research Domains

  • Machine Learning
  • Data Mining
  • String Algorithms

Publication List

  • Satoshi Yoshida and Takuya Kida, An efficient Variable-to-Fixed-length encoding using multiplexed parse trees, In Journal of Discrete Algorithms, Vol. 32, pp. 75-86, May 2015.
  • Satoshi Yoshida and Takuya Kida, A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm, In IPSJ Transactions on Databases, Vol. 6, No. 4, pp. 17-23, September 2013.
  • Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, and Seishi Okamoto, Improving Parse Trees for Efficient Variable-to-Fixed Length Codes, In Journal of Information Processing, Vol. 20, No. 1, pp. 238-249, January 2012.

Memberships

  • Information Processing Society of Japan

Conference presentation

  • Satoshi Yoshida, Hirohito Sasakawa, Kei Sekine, and Takuya Kida, Direct Access to Variable-to-Fixed Length Codes with a Succinct Index, In Proc. of Data Compression Conference 2014 (DCC 2014), p. 436, Snowbird, Utah, USA, March 2014.
  • Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, and Takuya Kida, Adaptive Dictionary Sharing Method for Re-Pair Algorithm, In Proc. of Data Compression Conference 2014 (DCC 2014), p. 425, Snowbird, Utah, USA, March 2014.
  • Satoshi Yoshida and Takuya Kida, Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm, In Proc. of Data Compression Conference 2013 (DCC 2013), p. 532, Snowbird, Utah, USA, March 2013.
  • Kei Sekine, Hirohito Sasakawa, Satoshi Yoshida, and Takuya Kida, Variable-to-Fixed-Length Encoding for Large Texts Using Re-Pair Algorithm with Shared Dictionaries, In Proc. of Data Compression Conference 2013 (DCC 2013), p.518, Snowbird, Utah, USA, March 2013.
  • Satoshi Yoshida and Takuya Kida, Analysis of Multiplexed Parse Trees for Almost Instantaneous VF codes, In Proc. of 3rd IIAI International Conference on e-Services and Knowledge Management (IIAI ESKM 2012), pp. 36-41, Fukuoka, Japan, September 2012.
  • Satoshi Yoshida and Takuya Kida, On Performance of Compressed Pattern Matching on VF Codes, In Proc. of Data Compression Conference 2011 (DCC 2011), p. 486, Snowbird, Utah, USA, March 2011.
  • Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, and Seishi Okamoto, Training Parse Trees for Efficient VF Coding, In Proc. of String Processing and Information Retrieval (SPIRE 2010), pp. 179-184, Los Cabos, Mexico, October 2010.
  • Satoshi Yoshida and Takuya Kida, An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree, In Proc. of Data Compression Conference 2010 (DCC 2010), pp. 219-228, Snowbird, Utah, USA, March 2010.

Biography

  • March 2005: Graduated from Hokkaido Sapporo Asahigaoka High School
  • March 2009: Received BE degree from Hokkaido University
  • March 2011: Received MS degree from Hokkaido University
  • March 2014: Received Ph.D. degree from Hokkaido University
  • April 2014: Entered NEC corporation

Top of this page