Tetsuo Asano Professor
School of Information Science（Department of Information Science・Theoretical Information Science）

Results 121-140 of about 145

• 121.　A new approximation scheme for digital objects and curve lengthy estimations，Asano, T., Kawamura, Y., Klette, R., Obokkata，Internat. Conf. IVCNZ'00，26--31，Nov., 2000
• 122.　ディジタル直線検出問題の計算量に関するアルゴリズム論的考察，浅野，河村，電子情報通信学会論文誌Ｄ，Vol.J83-D-I，No.1，80-89，Jan-00
• 123.　Optimal Roundings of Sequences and Matrices，T. Asano, T. Matsui, and T. Tokuyama，Nordic Journal of Computing，Vol.17，No.3，418-427，Mar-00
• 124.　A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree，T. Asano, N. Katoh, and K. Kawashima，Journal of Combinatorial Optimization，Vol.5，213-231，2001
• 125.　On detecting digital line components in a binary image，T. Asano, K. Obokata, T. Tokuyama，IEICE Trans. on Fundamentals，Vol.E84-A，No.5，1120-1129，1-May
• 126.　Efficient Algorithms for Optimization-based Image Segmentation，T. Asano, D.Z. Chen, N. Katoh, and T. Tokuyama，International Journal of Computational Geometry and Applications，Vol.11，No.2，145-166，2001
• 127.　A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images，T. Asano, N. Katoh, and T. Tokuyama，Computational Geometry: Theory and Applications，Vol.18，73-93，2001
• 128.　Effective Use of Geometric Information for Clustering and Related Topics，T. Asano，IEICE Trans. D，Vol.E83-D，No.3，418-427，Mar-00
• 129.　Dynamically maintaining the widest k-dense corridor，S. C. Nandy, T. Harayama, T. Asano，Theoretical Computer Science，Vol. 255，627-639，2001
• 130.　「ディジタル・ハーフトーニング：アルゴリズム工学の視点」（査読付），浅野哲夫（単著），情報処理，Vol.43，No.5，pp.554-561，2002
• 131.　On the Complexities of the optimal rounding problems of sequences and matrices，T. Asano, T. Matsui and T. Tokuyama，Nordic Journal of Computing，Vol.17，No.3，418-427，2001
• 132.　Efficient Algorithms for Optimization-based Image Segmentation，T. Asano, D.Z. Chen, N. Katoh, and T. Tokuyama，International Journal of Computational Geometry and Applications，11，2，145-166，2001(refereed article)
• 133.　On detecting digital line components in a binary image，T. Asano, K. Obokata, T. Tokuyama，IEICE Trans. on Fundamentals，E84-A，5，1120-1129，May 2001(refereed article)
• 134.　Optimal Roundings of Sequences and Matrices，T. Asano, T. Matsui, and T. Tokuyama，Nordic Journal of Computing，17，3，418-427，Mar 2000(refereed article)
• 135.　Effective Use of Geometric Information for Clustering and Related Topics，T. Asano，IEICE Trans. D，E83-D，3，418-427，Mar 2000(refereed article)
• 136.　「ＬＥＤＡ＋アルゴリズム＝プログラム」，浅野哲夫（単著），オペレーションズ・リサーチ，Vol. 45，No. 3，pp.132-137，2000
• 137.　「ＬＥＤＡ：複雑なアルゴリズムも簡単にプログラム化できる魔法のツール」，浅野哲夫，小保方幸次，Kurt Mehlhorn，情報処理，Vol.41，No.7，pp.854-861，2000
• 138.　A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree，T. Asano, N. Katoh, and K. Kawashima，Journal of Combinatorial Optimization，to appear(refereed article)
• 139.　A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images，T. Asano, N. Katoh, and T. Tokuyama，Computational Geometry: Theory and Applications，18，73-93，2001(refereed article)
• 140.　Dynamically maintaining the widest k-dense corridor，S. C. Nandy, T. Harayama, T. Asano，Theoretical Computer Science，255，627-639，2001(refereed article)

[ ≪ Back ]

1  2  3  4  5  6  7  8

[ Next ≫ ]