TOP Page >  Search Result  >  Profile > Display All

Published Papers
Results per page:
Chronological sort:

 

 

Tetsuo Asano Professor
School of Information Science(Department of Information Science・Theoretical Information Science)

Results 21-40 of about 145

  • 21. Constant-Working-Space Algorithms for Image Processing,T. Asano,Monograph: ``ETVC08: Emerging Trends and Challenges in Visual Computing,'' ETVC 2008,268-283,2009
  • 22. A Linear-Space Algorithm for Distance Preserving Graph Embedding,T. Asano, P. Bose, P. Carmi, A. Maheshwari, C. Shu, M.. Smid, and S. Wuhrer,Computational Geometry: Theory and Applications,42,4,pp.289-304,2009
  • 23. Online Uniformity of Integer Points on a Line,Tetsuo Asano,information Processing Letters,109,1,pp.57-60,2008
  • 24. Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?.,Tetsuo Asano,Proc. Annual Symposium on Algorithms and Computation,1,2008/12
  • 25. Constant-Working-Space Algorithms,T. Asano,Proc. Kyoto RIMS International Workshop on Computational Geometry and Discrete Mathematics,2008/12
  • 26. Constant Working Space Algorithms with Applications,T. Asano,Abstracts of 5th International Conference of Applied Mathematics and Computing,p.I-47,2008/08/12
  • 27. Constant Working Space Algorithms with Applications,T. Asano,Abstracts of 5th International Conference of Applied Mathematics and Computing,p.I-47,2008/08/12
  • 28. Constant-Working-Space Image Scan with a Given Angle,T. Asano,Proc. 24th European Workshop on Computational Geometry,pp.165−168,2008/03/18
  • 29. Constant Working-Space Algorithms for Geometric Problems,Tetsuo Asano and Guenter Rote,Proc. Canadian Conference on Computational Geometry,pp.87-90,2009/08/16
  • 30. Constant-Working Space Algorithm for Image Processing,Tetsuo Asano,Proc. of the First AAAC Annual meeting, Hong Kong,2008
  • 31. Linear Boundary and Corner detection using limited number of sensor rows,Bishal Prasad, Arijit Bishnu, and Tetsuo Asano, IWCIA (Int. Workshop on Combinatorial Image Analysis) 2008, Buffalo, USA, April 7-9.,250-261,2008
  • 32. Some Generalizations of Least-Squares Algorithms,Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, and Takeshi Tokuyama,ISI-Computer Science Monograph edited by Bhargab B. Bhattacharya, World Scientific Publishers,pp.55-74,2009
  • 33. Space-Efficient Algorithm for Image Rotation,,T. Asano, S. Bitou, M. Motoki and N. Usui,IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,91-A,9,2341-2348,2008/09
  • 34. Disc Covering Problem with Application to Digital Halftoning,,T. Asano, Peter Brass, and Shinji Sasahara,Theory of Computing System.,to appear
  • 35. A Linear-Space Algorithm for Distance Preserving Graph Embedding,T. Asano, P. Bose, P. Carmi, A. Maheshwari, C. Shu, M.. Smid, and S. Wuhrer,Computational Geometry: Theory and Applications,to appear
  • 36. Voronoi Diagrams with Respect to Criteria on Vision Information,T. Asano, N. Katoh, H. Tamaki, and T. Tokuyama,Japan Journal of Industrial and Applied Mathematics,採録
  • 37. Aspect-Ratio Voronoi Diagram and Its Complexity Bounds,T. Asano,Information Processing Letters,105,1,26-31,2007
  • 38. Zone diagrams: Existence, Uniqueness and Algorithmic Challenge,,T. Asano, J. Matousek, and T. Tokuyama,SIAM J. on Computing,採録決定
  • 39. A Robust Fingerprint Indexing Scheme Using Minutia Neighborhood Structure and Low-order Delaunay Triangles,Xuefeng Liang, Arijit Bishnu and Tetsuo Asano,IEEE Transactions on Information Forensics and Security,採録決定
  • 40. Online Uniformity of Integer Points on a Line,Tetsuo Asano,24th European Workshop on Computational Geometry, March 18-20, Nancy, France.,99-102,2008

≪ Back ]  1  2  3  4  5  6  7  8 Next ≫ ]