The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hiroshi Imai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hiroshi Imai, Takao Asano
    Dynamic Orthogonal Segment Intersection Search. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:1-18 [Journal]
  2. Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro
    epsilon-Approximations of k-Label Spaces. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:1, pp:145-157 [Journal]
  3. Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro
    Epsilon-Approximations of k-label Spaces. [Citation Graph (0, 0)][DBLP]
    ALT, 1993, pp:288-299 [Conf]
  4. Ken-ichiro Kakihara, Hiroshi Imai
    Notes on the PAC Learning of Geometric Concepts with Additional Information. [Citation Graph (0, 0)][DBLP]
    ALT, 1992, pp:252-259 [Conf]
  5. Atsushi Masuda, Hiroshi Imai, Jeffery P. Hansen, Masatoshi Sekine
    Search space reduction in high level synthesis by use of an initial circuit. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 1995, pp:- [Conf]
  6. Mary Inaba, Hiroshi Imai
    Finding k-Closest-Pairs Efficiently for High Dimensional Data. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  7. Mary Inaba, Hiroshi Imai
    Geometric clustering models for multimedia databases. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  8. Kensuke Onishi, Hiroshi Imai
    Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  9. Akira Tajima, Hiroshi Imai
    Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  10. Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida
    Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:68-80 [Conf]
  11. Fumihiko Takeuchi, Hiroshi Imai
    Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:470-481 [Conf]
  12. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Quantum versus Deterministic Counter Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:584-594 [Conf]
  13. Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
    One-Way Probabilistic Reversible and Quantum One-Counter Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:436-446 [Conf]
  14. Tetsuo Shibuya, Hiroshi Imai, Shigeki Nishimura, Hiroshi Shimoura, Kenji Tenmoku
    Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. [Citation Graph (0, 0)][DBLP]
    CODAS, 1996, pp:246-0 [Conf]
  15. Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama
    Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:225-234 [Conf]
  16. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Fining k Points with Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:283-291 [Conf]
  17. Keiko Imai, S. Sumino, Hiroshi Imai
    Minimax Geometric Fitting of Two Corresponding Sets of Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:206-275 [Conf]
  18. Mary Inaba, Hiroshi Imai, Naoki Katoh
    Experimental Results of Randomized Clustering Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-1 [Conf]
  19. Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi
    Application of an Effective Geometric Clustering Method to the Color Quantization Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:477-478 [Conf]
  20. Mary Inaba, Naoki Katoh, Hiroshi Imai
    Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:332-339 [Conf]
  21. Tomonari Masada, Hiroshi Imai, Keiko Imai
    Enumeration of Regular Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:224-233 [Conf]
  22. Kensuke Onishi, Hiroshi Imai
    Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:463-465 [Conf]
  23. Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
    A Package for Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-17 [Conf]
  24. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
    On Computing Simple Circuits on a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:52-60 [Conf]
  25. Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
    Voronoi Diagrams by Divergences with Additive Weights. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:403-404 [Conf]
  26. Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai
    Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:352-361 [Conf]
  27. Kunihiko Sadakane, Hiroshi Imai
    Text Retrieval by Using k-word Proximity Search. [Citation Graph (0, 0)][DBLP]
    DANTE, 1999, pp:183-188 [Conf]
  28. Nobuhiko Kojiro, Ken'ichi Miura, Hiroshi Imai, Yahiko Kambayashi
    Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. [Citation Graph (0, 1)][DBLP]
    DASFAA, 1991, pp:491-497 [Conf]
  29. Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai
    Implementing the Context Tree Weighting Method for Text Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:123-132 [Conf]
  30. Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
    Finding Neighbor Communities in the Web Using Inter-site Graph. [Citation Graph (0, 0)][DBLP]
    DEXA, 2003, pp:558-568 [Conf]
  31. Mary Inaba, Hiroshi Imai
    Geometric Clustering Models in Feature Space. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:421-422 [Conf]
  32. Kunihiko Sadakane, Hiroshi Imai
    Finding Meaningful Regions Containing Given Keywords from Large Text Collections. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:353-354 [Conf]
  33. Yasubumi Sakakibara, Hiroshi Imai
    A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:315-325 [Conf]
  34. Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai
    Data Compression Method Combining Properties of PPM and CTW. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:268-283 [Conf]
  35. Kunihiko Sadakane, Hiroshi Imai
    A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. [Citation Graph (0, 3)][DBLP]
    ER Workshops, 1998, pp:434-445 [Conf]
  36. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility-Polygon Search and Euclidean Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:155-164 [Conf]
  37. Hiroshi Imai, Takao Asano
    Dynamic Segment Intersection Search with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:393-402 [Conf]
  38. Jozef Gruska, Hiroshi Imai, Keiji Matsumoto
    Power of Quantum Entanglement. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:3-22 [Conf]
  39. Susumu Hasegawa, Hiroshi Imai, Koji Hakata
    An Analysis of Randomized Shear Sort on the Mesh Computer. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:219-228 [Conf]
  40. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
    How to Treat Delete Requests in Semi-Online Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:48-57 [Conf]
  41. Koji Hakata, Hiroshi Imai
    The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:469-478 [Conf]
  42. Kazuyoshi Hayase, Hiroshi Imai
    OBDDs of a Monotone Function and of Its Prime Implicants. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:136-145 [Conf]
  43. Takayuki Osogami, Hiroshi Imai
    Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:72-83 [Conf]
  44. Kyoko Sekine, Hiroshi Imai, Seiichiro Tani
    Computing the Tutte Polynomial of a Graph of Moderate Size. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:224-233 [Conf]
  45. Seiichiro Tani, Hiroshi Imai
    A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:575-583 [Conf]
  46. Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
    Focusing on Sites in the Web. [Citation Graph (0, 0)][DBLP]
    ISDB, 2002, pp:154-159 [Conf]
  47. Jozef Gruska, Hiroshi Imai
    Power, Puzzles and Properties of Entanglement. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:25-68 [Conf]
  48. Tetsuo Shibuya, Hiroshi Imai
    New flexible approaches for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:267-276 [Conf]
  49. Hiroshi Imai, Kazuo Iwano
    Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:21-30 [Conf]
  50. Franz Aurenhammer, Hiroshi Imai
    Geometric Relations Among Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:53-65 [Conf]
  51. Jumpei Niwa, Keiji Matsumoto, Hiroshi Imai
    General-Purpose Parallel Simulator for Quantum Computing. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:230-251 [Conf]
  52. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    An Analysis of Absorbing Times of Quantum Walks. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:315-330 [Conf]
  53. Hiromi Aonuma, Hiroshi Imai, Yahiko Kambayashi
    A Visual System of Placing Characters Appropriately in Multimedia Map Databases. [Citation Graph (0, 0)][DBLP]
    VDB, 1989, pp:525-546 [Conf]
  54. Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
    Probing a Set of Hyperplanes by Lines and Related Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:72-82 [Conf]
  55. Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
    Weighted Orthogonal Linear L\infty-Approximation and Applications. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:183-193 [Conf]
  56. Yasuhito Asano, Tsuyoshi Ito, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
    Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database. [Citation Graph (0, 0)][DBLP]
    WAIM, 2003, pp:37-46 [Conf]
  57. Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
    Web-Linkage Viewer: Finding Graph Structures in the Web. [Citation Graph (0, 0)][DBLP]
    WAIM, 2002, pp:441-442 [Conf]
  58. Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
    Applying the Site Information to the Information Retrieval from the Web. [Citation Graph (0, 0)][DBLP]
    WISE, 2002, pp:83-92 [Conf]
  59. Hiroshi Imai
    On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. [Citation Graph (0, 0)][DBLP]
    WISE (2), 2001, pp:223-227 [Conf]
  60. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility of Disjoint Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:49-63 [Journal]
  61. Hiroshi Imai, Kenji Kato, Peter Yamamoto
    A Linear-Time Algorithm for Linear L_1 Approximation of Points. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:77-96 [Journal]
  62. Masao Iri, Hiroshi Imai
    A Multiplicative Barrier Function Method for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:4, pp:455-482 [Journal]
  63. Hon Wai Leong, Hiroshi Imai
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:3, pp:193-193 [Journal]
  64. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Two-way Quantum One-counter Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  65. Hiroshi Imai, Masao Iri
    Computational-geometric methods for polygonal approximations of a curve. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1986, v:36, n:1, pp:31-41 [Journal]
  66. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura
    A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:167-190 [Journal]
  67. Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto
    Orthogonal Weighted Linear L1 and Linfty Approximation and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:3, pp:217-232 [Journal]
  68. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
    Computing Simple Circuits form a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:289-304 [Journal]
  69. Hiroshi Imai
    Computation Geometry Research in Japan. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:164-167 [Journal]
  70. Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai
    Enumerating Triangulations in General Dimensions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:455-480 [Journal]
  71. Takao Asano, Tetsuo Asano, Hiroshi Imai
    Shortest Path Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:285-288 [Journal]
  72. Hiroshi Imai
    Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:3, pp:125-128 [Journal]
  73. Takao Asano, Tetsuo Asano, Hiroshi Imai
    Partitioning a polygonal region into trapezoids. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:2, pp:290-312 [Journal]
  74. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Finding k Points with Minimum Diameter and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:38-56 [Journal]
  75. Hiroshi Imai, Takao Asano
    Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:310-323 [Journal]
  76. Yasubumi Sakakibara, Hiroshi Imai
    A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:111-119 [Journal]
  77. Tetsuo Shibuya, Hiroshi Imai
    New Flexible Approaches for Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:3, pp:385-414 [Journal]
  78. David Avis, Hiroshi Imai
    Locating a Robot with Angle Mathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:311-326 [Journal]
  79. Kazuyoshi Hayase, Hiroshi Imai
    OBDDs of a Monotone Function and Its Prime Implicants. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:570-591 [Journal]
  80. Hiroshi Imai, Takao Asano
    Efficient Algorithms for Geometric Graph Search Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:478-494 [Journal]
  81. Hiroshi Imai, Masao Iri, Kazuo Murota
    Voronoi Diagram in the Laguerre Geometry and its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:93-105 [Journal]
  82. Takahiro Ikeda, Hiroshi Imai
    Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:2, pp:341-374 [Journal]
  83. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Quantum versus deterministic counter automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:334, n:1-3, pp:275-297 [Journal]
  84. Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
    One-way probabilistic reversible and quantum one-counter automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:963-976 [Journal]
  85. David Avis, Binay K. Bhattacharya, Hiroshi Imai
    Computing the volume of the union of spheres. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1988, v:3, n:6, pp:323-328 [Journal]
  86. Kimikazu Kato, Hiroshi Imai, Keiko Imai
    Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. [Citation Graph (0, 0)][DBLP]
    ISVD, 2007, pp:265-269 [Conf]

  87. Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints. [Citation Graph (, )][DBLP]


  88. On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation. [Citation Graph (, )][DBLP]


  89. Voronoi Diagrams on Periodic Graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.461secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002