Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SIS, IPSJ-AVM, ITE-3DMT [detail] |
2020-06-03 16:30 |
Online |
Online |
[Invited Talk]
Data compression and pattern matching Takuya Kida (Hokkai-Gakuen Univ.) SIS2020-5 |
(To be available after the conference date) [more] |
SIS2020-5 pp.25-30 |
COMP |
2019-10-25 10:00 |
Hokkaido |
Sapporo Campus, Hokkaido University |
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN) COMP2019-18 |
[more] |
COMP2019-18 pp.1-10 |
COMP |
2016-09-06 14:30 |
Toyama |
Toyama Prefectural University |
On Enumeration of Spatial Proximity Patterns by Rectangle of Fixed Range in two Dimensions Tomoaki Ogasawara, Hiroshi Imai (Univ. of Tokyo), Takuya Kida (Hokkaido Univ.) COMP2016-19 |
(To be available after the conference date) [more] |
COMP2016-19 pp.29-35 |
PRMU |
2014-03-14 15:00 |
Tokyo |
|
Feature Extraction Using Local Gradient Pattern Hiroki Terashima, Takuya Kida (Hokkaido Univ.) PRMU2013-209 |
Local Binary Pattern (LBP) is an image feature that widely used for image classification.This feature consists of a hist... [more] |
PRMU2013-209 pp.247-252 |
IBISML |
2012-03-12 10:00 |
Tokyo |
The Institute of Statistical Mathematics |
Chance Adjusted Infinite Relational Model for Asymmetric and Individually Different Relational Data Analysis Iku Ohama, Hiromi Iida (Panasonic), Takuya Kida, Hiroki Arimura (Hokkaido Univ.) IBISML2011-87 |
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed ... [more] |
IBISML2011-87 pp.1-8 |
IBISML |
2011-03-28 10:20 |
Osaka |
Nakanoshima Center, Osaka Univ. |
Event Clustering Method based on Linear HMM for Geotagged Personal Contents Iku Ohama (Panasonic), Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Toshihisa Abe (Panasonic) IBISML2010-105 |
We discuss the geographical clustering problem on human activity logs. In this Paper, we formulate the problem as a segm... [more] |
IBISML2010-105 pp.9-16 |
COMP |
2009-06-29 10:00 |
Hokkaido |
Hokkaido University |
Compressed Pattern Matching on VF Codes Takuya Kida (Hokkaido Univ.) COMP2009-18 |
We discuss the problem of pattern matching on a VF coded text. We introduce a KMP-type pattern matching algorithm that r... [more] |
COMP2009-18 pp.1-8 |
PRMU |
2008-12-18 10:00 |
Kumamoto |
Kumamoto Univ. |
Two Dimensional Pattern Matching for JPEG Images Tomoharu Nakano, Takuya Kida (Hokkaido Univ.) PRMU2008-151 |
We can touch a numerous number of images on the Internet in this days.
Almost all images are stored in compressed form.... [more] |
PRMU2008-151 pp.25-30 |
COMP |
2007-04-26 17:00 |
Kyoto |
Katsura Campus, Kyoto University |
On an Efficient Off-Line Construction of Property Suffix Trees Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) COMP2007-10 |
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target... [more] |
COMP2007-10 pp.71-78 |
DE |
2005-07-14 13:40 |
Aomori |
OIRASE |
* Takuya Kida (Hokkaido Univ.), Toshiro Minami (Kyushu Inst. of Info. Sciences/Kyushu Univ.) |
[more] |
DE2005-91 pp.151-156 |
COMP |
2004-09-17 10:30 |
Hokkaido |
Hokkaido University |
Space-Saving Linear-Time Approximation Algorithm for Grammar-Based Compression Takuya Kida (Hokkaido Univ.), Hiroshi Sakamoto, Shinichi Shimozono (KIT) |
A space-efficient linear-time approximation algorithm for the grammar-based compression problem, which requests for a gi... [more] |
COMP2004-26 pp.1-8 |