Hiroshi IMAI


Parameterized Algorithms to Compute Ising Partition Function
Hidefumi HIRAISHI Hiroshi IMAI Yoichi IWATA Bingkai LIN 
Publication:   
Publication Date: 2018/09/01
Vol. E101-A  No. 9  pp. 1398-1403
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
Ising modelpartition functionbranch decompositionrank decompositionfixed parameter tractability
 Summary | Full Text:PDF(882.1KB)

Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case
Hiroshi IMAI Vorapong SUPPAKITPAISARN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1216-1222
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
analysis of algorithmsnumber representationelliptic curve cryptographymulti-scalar multiplicationwidth-3 joint sparse form
 Summary | Full Text:PDF(495.5KB)

Two Lower Bounds for Shortest Double-Base Number System
Parinya CHALERMSOOK Hiroshi IMAI Vorapong SUPPAKITPAISARN 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/06/01
Vol. E98-A  No. 6  pp. 1310-1312
Type of Manuscript:  LETTER
Category: Algorithms and Data Structures
Keyword: 
analysis of algorithmsnumber representationelliptic curve cryptographydouble-base number systemdouble-base chain
 Summary | Full Text:PDF(80.5KB)

Finding Neighbor Communities in the Web Using an Inter-Site Graph
Yasuhito ASANO Hiroshi IMAI Masashi TOYODA Masaru KITSUREGAWA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/09/01
Vol. E87-D  No. 9  pp. 2163-2170
Type of Manuscript:  PAPER
Category: Database
Keyword: 
information retrievalWeb communityWeb site
 Summary | Full Text:PDF(314.3KB)

Compact Encoding of the Web Graph Exploiting Various Power Distributions
Yasuhito ASANO Tsuyoshi ITO Hiroshi IMAI Masashi TOYODA Masaru KITSUREGAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/05/01
Vol. E87-A  No. 5  pp. 1183-1184
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
Web graphencodingpower distributions
 Summary | Full Text:PDF(81.7KB)

Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees
Ayumu NAGAI Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/10/01
Vol. E85-D  No. 10  pp. 1645-1653
Type of Manuscript:  PAPER
Category: Artificial Intelligence, Cognitive Science
Keyword: 
AND/OR treeAO*pn-searchdf-pn
 Summary | Full Text:PDF(259.5KB)

Fast Algorithms for k-Word Proximity Search
Kunihiko SADAKANE Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2001/09/01
Vol. E84-A  No. 9  pp. 2311-2318
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
proximity searchtext retrievalplane-sweepdivide-and-conquer
 Summary | Full Text:PDF(262.5KB)

Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting
Kunihiko SADAKANE Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/12/25
Vol. E83-A  No. 12  pp. 2689-2698
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
LZ77hashgzipsuffix sortingblock sorting
 Summary | Full Text:PDF(496.1KB)

Variance-Based k-Clustering Algorithms by Voronoi Diagrams and Randomization
Mary INABA Naoki KATOH Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/06/25
Vol. E83-D  No. 6  pp. 1199-1206
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
geometric clusteringVoronoi diagramrandomization
 Summary | Full Text:PDF(391.7KB)

Computing the Invariant Polynomials of Graphs, Networks and Matroids
Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3  pp. 330-343
Type of Manuscript:  INVITED SURVEY PAPER
Category: Algorithms for Matroids and Related Discrete Systems
Keyword: 
Tutte polynomialmatroidsimplicial complexnetwork reliabilityBDD
 Summary | Full Text:PDF(513.5KB)

Divergence-Based Geometric Clustering and Its Underlying Discrete Proximity Structures
Hiroshi IMAI Mary INABA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/01/25
Vol. E83-D  No. 1  pp. 27-35
Type of Manuscript:  INVITED PAPER (Special Issue on Surveys on Discovery Science)
Category: 
Keyword: 
unsupervised learninggeometric clusteringVoronoi diagramcomputational geometryinformation geometry
 Summary | Full Text:PDF(349.8KB)

Computational Investigations of All-Terminal Network Reliability via BDDs
Hiroshi IMAI Kyoko SEKINE Keiko IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/05/25
Vol. E82-A  No. 5  pp. 714-721
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
network reliabilityBDDoutput-size sensitive#P-complete
 Summary | Full Text:PDF(586.3KB)

Finding Useful Detours in Geographical Databases
Tetsuo SHIBUYA Hiroshi IMAI Shigeki NISHIMURA Hiroshi SHIMOURA Kenji TENMOKU 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1999/01/25
Vol. E82-D  No. 1  pp. 282-290
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
geographical databasescar navigationshortest pathsdetour query
 Summary | Full Text:PDF(518.8KB)

Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams
Keiko IMAI Shigeo SUMINO Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/11/25
Vol. E81-D  No. 11  pp. 1162-1171
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
computational geometrylower envelopeslinearizationDavenport-Schinzel sequences
 Summary | Full Text:PDF(870.3KB)

Counting the Number of Paths in a Graph via BDDs
Kyoko SEKINE Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/04/25
Vol. E80-A  No. 4  pp. 682-688
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
graphspaths#P-completeBDD
 Summary | Full Text:PDF(620.6KB)

Geometric Algorithms for Linear Programming
Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/03/25
Vol. E76-A  No. 3  pp. 259-264
Type of Manuscript:  INVITED PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
Category: 
Keyword: 
computational geometrylinear programmingprune-and-searchrandomization
 Summary | Full Text:PDF(551.9KB)

A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line
Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Vol. E74-A  No. 4  pp. 665-668
Type of Manuscript:  Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
 Summary | Full Text:PDF(287.9KB)

Finding a Maximum Weight Independent Set of a Circle Graph
Takao ASANO Hiroshi IMAI Akira MUKAIYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Vol. E74-A  No. 4  pp. 681-683
Type of Manuscript:  Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
 Summary | Full Text:PDF(210.5KB)

On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids
Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Vol. E74-A  No. 4  pp. 669-671
Type of Manuscript:  Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
 Summary | Full Text:PDF(184.8KB)

Notes on the One-Dimensional Compaction Problem of LSI Layouts Viewed from Network Flow Theory and Algorithms
Hiroshi IMAI 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1986/10/25
Vol. E69-E  No. 10  pp. 1080-1083
Type of Manuscript:  PAPER
Category: Mathematics, Combinatorics and Graph Theory
Keyword: 
 Summary | Full Text:PDF(310KB)