Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2023-08-04 11:25 |
Kanagawa |
Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Constructing Visual Cryptography Schemes for Multiple Images Using SAT Technology Tako Hiroaki (Univ. Yamanashi), Xiao-Nan Lu (Gifu Univ.), Nabeshima Hidetomo (Univ. Yamanashi) IT2023-25 |
The visual cryptography scheme (VCS) is a type of secret sharing scheme for images.The VCS uses matrices called basis ma... [more] |
IT2023-25 pp.62-67 |
KBSE, SS, IPSJ-SE [detail] |
2014-07-10 15:50 |
Hokkaido |
Furano-Bunka-Kaikan |
Improving efficiency of pseudo-Boolean solver that uses SAT solver and BDD Masahiko Sakai (Nagoya Univ.), Hidetomo Nabeshima (Univ. of Yamanashi) SS2014-17 KBSE2014-20 |
[more] |
SS2014-17 KBSE2014-20 pp.93-98 |
AI |
2010-06-25 14:15 |
Tokyo |
|
Refining Noisy Training Examples Based on Ensemble Learning for Intelligent Domain-Specific WEB Search Hiroki Hirabayashi, Koji Iwanuma, Yoshitaka Yamamoto, Hidetomo Nabeshima (Univ. of Yamanashi) AI2010-5 |
The Keyword Spices, proposed Oyama et al., is a sort of a query-expansion technology, which adds pre-computed additional... [more] |
AI2010-5 pp.25-30 |
SS |
2009-03-02 16:15 |
Saga |
Saga University |
A division technique for a SAT problem in a distributed SAT solver Akihide Takami, Hidetomo Nabeshima, Koji Iwanuma (Yamanashi Univ) SS2008-52 |
In this paper, we introduce SatCube which is a Boolean satisfiability (SAT) problem solver and is a parallel and distrib... [more] |
SS2008-52 pp.23-28 |
IT |
2008-09-11 14:30 |
Okinawa |
Culture Resort Festone (Okinawa) |
An Improvement for Lossless Data Compression Based on Grammatical Inference Bayu Yudistira, Koji Iwanuma, Hidetomo Nabeshima (Univ of Yamanashi) IT2008-22 |
Recently, the research on grammatical-inference data compression method has been done actively, such as Sequitur algorit... [more] |
IT2008-22 pp.13-18 |
AI |
2007-05-31 10:45 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Parallel SAT Solver for Multi-Core Processor Environment Akihide Takami, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) AI2007-2 |
In this paper, we propose a new parallel SAT solver based on the fastest sequential SAT solver ”Mini-
Sat” for a multi-... [more] |
AI2007-2 pp.7-12 |
AI, KBSE |
2007-03-28 14:20 |
Tokyo |
|
Sequential Pattern Mining for Extracting Hierarchical Pattern Osamu Yoshida, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) |
In this work, we proposes sequential pattern mining technique to discover a hierarchical patterns having
difficulty wit... [more] |
AI2006-71 KBSE2006-79 pp.45-48 |
AI |
2006-11-10 10:30 |
Kyoto |
|
Fast Algorithms for inclusion check in a sequence set to extract Hiroki Ichikawa, Koji Iwanuma, Hidetomo Nabeshima (Uni. of Yamanashi) |
[more] |
AI2006-13 pp.7-12 |
AI |
2006-11-10 11:00 |
Kyoto |
|
Sequential Pattern Mining for Web Access Logs Osamu Yoshida, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) |
[more] |
AI2006-14 pp.13-18 |
AI |
2006-05-18 11:10 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Effective SAT Planning and SAT Scheduling by Lemma Reusing Hidetomo Nabeshima (Univ. of Yamanashi), Takehide Soh (Kobe Univ.), Katsumi Inoue (NII), Koji Iwanuma (Univ. of Yamanashi) |
In this paper, we propose a new approach, called {\itshape lemma-reusing}, for accelerating SAT based planning and sched... [more] |
AI2006-4 pp.19-24 |
AI |
2006-03-07 14:30 |
Osaka |
Kwansei Gakuin University |
Question Answering System Based on Frequent Words in Web Documents Naoki Fujieda, Koji Iwanuma, Hidetomo Nabeshima (Yamanashi Univ.) |
[more] |
AI2005-51 pp.25-29 |
AI |
2006-03-07 15:00 |
Osaka |
Kwansei Gakuin University |
Refining Training Data Based on Document Similarity for Semi-automatic Building Domain-Specific Web Search Engines Reiko Miyagawa, Koji Iwanuma, Hidetomo Nabeshima (Yamanashi Univ.) |
[more] |
AI2005-52 pp.31-36 |
NLC |
2006-02-02 15:15 |
Shiga |
Laforet Biwako |
News Clustering Based on the Background Similarity Chinatsu Hirose, Koji Iwanuma, Hidetomo Nabeshima (Yamanashi Univ) |
[more] |
NLC2005-110 pp.25-30 |
NLC |
2006-02-03 11:00 |
Shiga |
Laforet Biwako |
Automatic Generation of Domain-specific Vocabulary Template and Integration of Web Pages Masayuki Suda, Koji Iwanuma, Hidetomo Nabeshima (Yamanashi Univ.) |
Demand of comparing products or services provided in Internet frequently occurs. In this paper, we propose an approach o... [more] |
NLC2005-117 pp.19-24 |
AI |
2005-05-31 16:05 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Narrowing Frequent Patterns by Relation Strength in Sequencial Pattern Mining Naoki Ohtsuka, Koji Iwanuma, Hidetomo Nabeshima (Univ. of Yamanashi) |
[more] |
AI2005-5 pp.21-26 |
AI |
2005-05-31 16:30 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Refinement of Training Examples for Semi-Automated Generation of Keyword Spices Yuki Suzuki, Hidetomo Nabeshima, Koji Iwanuma (Univ. of Yamanashi) |
Keyword spice method proposed by Kokubo et al. for building domain-specific web search engine is a good approach which s... [more] |
AI2005-6 pp.27-31 |
AI |
2004-06-21 15:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Upside-Down Transfromation in SOL and its Application Koji Iwanuma (Yamanashi Univ.), Katsumi Inoue (NII), Hidetomo Nabeshima (Yamanashi Univ.) |
[more] |
AI2004-8 pp.39-44 |