IEICE Trans

Hiroshi IMAI

Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial Farley Soares OLIVEIRA Hidefumi HIRAISHI Hiroshi IMAI
Publication: Publication Date: 2019/09/01 Vol. E102-A No. 9 pp. 1022-1027 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Graph algorithms Keyword: BDD, Tutte polynomial, graph, pathwidth, FPT algorithm,
	Summary \| Full Text:PDF

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 model, partition function, branch decomposition, rank decomposition, fixed parameter tractability,
	Summary \| Full Text:PDF

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 algorithms, number representation, elliptic curve cryptography, multi-scalar multiplication, width-3 joint sparse form,
	Summary \| Full Text:PDF

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 algorithms, number representation, elliptic curve cryptography, double-base number system, double-base chain,
	Summary \| Full Text:PDF

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 retrieval, Web community, Web site,
	Summary \| Full Text:PDF

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 graph, encoding, power distributions,
	Summary \| Full Text:PDF

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 tree, AO^*, pn-search, df-pn,
	Summary \| Full Text:PDF

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 search, text retrieval, plane-sweep, divide-and-conquer,
	Summary \| Full Text:PDF

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: LZ77, hash, gzip, suffix sorting, block sorting,
	Summary \| Full Text:PDF

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 clustering, Voronoi diagram, randomization,
	Summary \| Full Text:PDF

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 polynomial, matroid, simplicial complex, network reliability, BDD,
	Summary \| Full Text:PDF

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 learning, geometric clustering, Voronoi diagram, computational geometry, information geometry,
	Summary \| Full Text:PDF

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 reliability, BDD, output-size sensitive, #P-complete,
	Summary \| Full Text:PDF

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 databases, car navigation, shortest paths, detour query,
	Summary \| Full Text:PDF

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 geometry, lower envelopes, linearization, Davenport-Schinzel sequences,
	Summary \| Full Text:PDF

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: graphs, paths, #P-complete, BDD,
	Summary \| Full Text:PDF

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 geometry, linear programming, prune-and-search, randomization,
	Summary \| Full Text:PDF

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

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

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

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