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

Results 101-120 of about 145

• 101.　Geometry, Morphology, and Computational Imaging，T.Asano, R.Klette, C.Ronse，Proc. 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Lecture Notes on Computer Science 2616, 2003，2003
• 102.　Digital Halftoning: Algorithm Engineering Challenges，T.Asano，IEICE Trans. on Inf. and Syst., E86-D, 2, pp.159-178, 2003，pp.159-178，2003
• 103.　Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning，T. Asano, N. Katoh, K. Obokata, and T. Tokuyama，SIAM J. on COmputing，32，8，1423-1435，to appear
• 104.　Minimizing the endpoint trace length of rod motion amidst polygonal obstacles is NP-hard，T. Asano, D. Kirkpatrick, C.K. Yap，Proc. 15 Canadian Conference on Computational Geometry, August 11-13, 2003, Dalhousie University, Halifax，10-13，2003
• 105.　A New Approach to Transportation Scheduling Problem Based on Network Flow Theory，T.Asano, E.Chiba，Proc. 7th Japan Korea Joint Workshop on Algorithms and ComputationSendai，pp.228-236，2003/07/
• 106.　Pseudo-approximation algorithm with applications to optimal motion planning，T.Asano, D.G.Kirkpatrick, and C.K. Yap，Discrete and Computational Geometry, to appear，to appear
• 107.　Digital Curve Approximation with Length Evaluation，T.Asano, Y.Kawamura, R.Klette, and K.Obokata，IEICE Trans. on Fundamentals, E86-A, 5, May 2003，2003/05
• 108.　Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning，T.Asano, D.Kirkpatrick, C.Yap，Proc. ACM Symp. on Computational GeometryBarcelona，pp.170-178，2002/06/
• 109.　Shattering a set of objects in 2D，S.C.Nandy, T.Asano, and T.Harayama，Discrete Applied Math., 122 pp.183-194, 2002.，pp.183-194，2002/
• 110.　Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning，T.Asano, N.Katoh, K.Obokata, T.Tokuyama，Proc. SIAM-ACM Symp. on Discrete AlgorithmsSan Francisco，pp.896-904，2002/01/
• 111.　Algorithmic Evaluation of Line Detection Problem，T.Asano，Interdisciplinary Information Science, Vol.8, No.2, pp.137-145, December 2002.，Vol.8，No.2，pp.137-145，2002/12/
• 112.　Translating a convex polyhedron over monotone polyhedra，T.Asano, A.Hernandez-Barrera, and S.C.Nandy，CGTA: Comput. Geom. Theory and Appli., 23, pp.257-269, 2002.，pp.257-269，2002
• 113.　Minimum-length polygons in approximation sausages，T. Asano, Y. Kawamura, R. Klette, K. Obokata，Proc.，LNCS 2059，103-112，May, 2001
• 114.　Digital Halftoning Algorithm Based on Random Space-Filling Curve，T. Asano，IEICE Trans. on Fundamentals，Vol.E82-A，No.3，553-556，Mar-99
• 115.　ＬＥＤＡ：複雑なアルゴリズムも簡単にプログラム化できる魔法のツール，浅野哲夫，情報処理，2000年7月
• 116.　画像処理と計算幾何学：計算幾何学は画像処理に如何に貢献できるか，浅野哲夫，数理科学，1999年7月
• 117.　ＬＥＤＡ＋アルゴリズム＝プログラム，浅野哲夫，オペレーションズリサーチ，2000年3月
• 118.　「計算幾何学」，浅野哲夫（単著），日本ファジィ学会誌, Vol.13, No. 2, pp.130-138，2001
• 119.　Matrix Rounding under the Lp-Discrepancy Measure and Its Aoolication to Digital Halftoning，T. Asano, N. Katoh, K. Obokata, and T. Tokuyama，Proc. ACM-SIAM Symp. on Discrete Algorithms,，896--904，2002
• 120.　How to Color a Checkerboard with a Given Distribution---Matrix Rounding Achieving Low $2\times2$-Discrepancy，Tetsuo Asano and Takeshi Tokuyama，Lecture Notes in Computer Science，Vol. 2223，636-645，2001

[ ≪ Back ]

1  2  3  4  5  6  7  8

[ Next ≫ ]