Selected Publications

  1. T. Kameda, I Suzuki and Z.J. Zhang, Finding the minimum-distance schedule for a boundary searcher with a flashlight, Proc. LATIN 2010, April 2010, Oaxaca, Mexico. To appear.
  2. T. Kameda and Z.J. Zhang, An efficient algorithm for finding all door locations that make a room searchable, Intn'l J. of Computational Geometry and Applications, To appear.
  3. Y. Sun, F. Ma and T. Kameda, Generating asymptotically optimal broadcasting schedules to minimize average waiting time, Discrete Mathematics 309 (Sept. 2009), pp. 5714-5723.
  4. Y. Sun and T. Kameda, Approaching the limits of fixed-delay broadcasting schemes for video-on-demand, Proc. 2009 IEEE Pacific Rim Conf. on Communications, Computers & Signal Processing Victoria, Canada, Aug. 2009, pp. 786-791.
  5. B. Bhattacharya, Z.Zhang, and T. Kameda, Surveillance of a polygonal area by mobile searcher from the boundary: Searchability testing, Proc. IEEE Intn'l Conf. on Robotics and Automation, May 2009, Kobe, pp. 2461-2466.
  6. T. Kameda, Z. Zhang and M. Yamashita, Searching a circular corridor by two boundary 1-searchers, Proc. 1st AAAC Annual Meeting, Hong Kong, Apr. 2008, p. 33.
  7. Z. Zhang and T. Kameda, A linear-time algorithm for finding all door locations that make a room searchable, Proc. TAMC 2008, Xian, China, Apr. 2008, LNCS 4978, pp. 508-519.
  8. Y. Sun and T. Kameda, Minimizing the average waiting time in VoD broadcasting, Proc. 5th Int'l Conf. on Information \& Communications Technology, Cairo, Egypt, Dec. 2007, pp. 223-228.
  9. Z. Zhang and T. Kameda, Where to build a door, Proc. IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems (IROS) , Beijing, Oct. 2006, pp. 4084-4090.
  10. E. Yan and T. Kameda, Generalized Fibonacci Broadcasting: an efficient VOD broadcasting scheme with user bandwidth limit, Discrete Applied Mathematics , vol. 154, issue 16, 2006, pp. 2418-2429.
  11. T. Kameda, Z.Zhang and M. Yamashita, Simple characterization of polygons searchable by 1-searcher, Proc. Canadian Conf. on Computational Geometry, Aug. 2006, pp. 113-116. pdf
  12. B. Bhattacharya, Z.Zhang, Q. Shi and T. Kameda, An optimal solution to room search problem, Proc. Canadian Conf. on Computational Geometry, Aug. 2006, pp. 55-58.
  13. T. Kameda, M. Yamashita, and I. Suzuki, On-line polygon search by a seven-state boundary 1-searcher, IEEE Trans. Robotics,, vol. 22, no. 3, June 2006, pp. 446-460.
  14. T. Kameda, Y. Sun and L. Goddyn, An optimization problem related to VoD broadcasting, Proc. ISAAC 2005, LNCS 3827, Springer-Verlag, pp. 116-125. Hainan, Dec. 2005.
  15. Yi Sun and T. Kameda, Harmonic block windows scheduling through Harmonic windows scheduling, Proc. Int'l Workshop on Multimedia Information Systems, Springer-Verlag, Sorrento, Sept. 2005, pp. 190-206.
  16. Yi Sun and T. Kameda, Harmonic block windows scheduling for video-on-demand broadcasting, Technical Report CMPT-TR 2005-05, February 2005. Submitted for publication. pdf
  17. M. Yamashita, I.Suzuki, and T. Kameda, Searching a polygonal region by a group of stationary k-searchers, Information Processing Letters 92, 2004, pp. 1-8.
  18. T. Kameda and Y. Sun, Optimal truncated-Harmonic windows scheduling for broadcast systems, Technical Report CMPT-TR 2003-10, School of Computing Science, SFU, September 2003, pdf
  19. T. Kameda and Y. Sun, A survey on VOD broadcasting schemes, School of Computing Science, SFU, August 2003, pdf
  20. T. Kameda and S. Wu, A lossless VOD broadcasting scheme for VBR videos using available channel bandwidths, Technical Report CMPT-TR 2003-09, School of Computing Science, SFU, August 2003, pdf
  21. S. Wu and T. Kameda, Lossless VBR video broadcasting considering user bandwidth limit, Technical Report CMPT-TR 2003-08, School of Computing Science, SFU, July 2003, Proc. IEEE Int'l Conference on Multimedia & Expo (ICME'04), Taiwan, June 27-30, 2004. pdf
  22. E. Yan and T. Kameda, An efficient VOD broadcasting scheme with user bandwidth limit, Proc. SPIE/ACM Conference on Multimedia Computing and Networking, Santa Clara, January 2003, pp. 200-208. pdf
  23. K. Makino, M. Yamashita, and T. Kameda, Max- and Min-neighborhood monopolies, Algorithmica, vol. 34(2002), pp. 240-260. pdf
  24. M. Yamashita, H. Umemoto, I. Suzuki and T. Kameda, Searching for mobile intruders in a polygonal region by a group of mobile searcher s, Algorithmica, vol. 31 (2001), no. 2, pp. 208-236. pdf
  25. K. Makino and T. Kameda, Transformations on regular non-dominated coteries and their applications, SIAM J. on Discrete Mathematics, vol. 14(2001), no. 3, pp. 381-407. pdf
  26. I. Suzuki, Y. Tazoe, M. Yamashita, and T. Kameda, Searching a polygonal region from the boundary, Int'l J. of Computational Geometry, vol. 11 (2001), no. 5, pp. 529-553. pdf
  27. K. Makino and T. Kameda, Efficient generation of all regular non-dominated coteries, Proc. ACM Symp. Principles of Distributed Computing (PODC), Portland, Oregon, July 16-20, 2000. pdf
  28. T. Kameda, F. Xiao and M. Guerni-Mahoui, Average probe complexity of non-dominated coteries, Proc. ACM Symp. Principles of Distributed Computing (PODC), Portland, Oregon, July 16-20, 2000.
  29. K. Makino, M. Yamashita and T. Kameda, Max- and min-neighborhood monopolies, SWAT 2000, Bergen Norway, Jul 5-7, 2000.
  30. S. Fujita, M. Yamashita, and T. Kameda, A study on r-configurations - A resource assignment problem on graphs, SIAM J. Computing, vol. 13 (2000), no. 2, pp. 227-254.
  31. M. Yamashita and T. Kameda, Modeling K-coteries by well-covered graphs, Networks, vol. 34 (1999), 221-228.
  32. M. Yamashita and T. Kameda, Leader election problem on networks in which processor identity numbers are not distinct, IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9 (Sept. 1999), 878-887.
  33. X. Deng, T. Kameda, and C.H. Papadimitriou, How to learn an unknown environment I: the rectilinear case, J. ACM, March 1998, 215-245.
  34. I. Suzuki, M. Yamashita, H. Umemoto, and T. Kameda, Bushiness and a tight worst-case upper bound on the search number of a simple polygon, Information Processing Letts, vol. 66, 1998, 49-52.
  35. T. Ibaraki and T. Kameda, Multi-frame isochronous service for ATM networks: Stop-and-Go revisited, Proc. 6th Int'l Conf. on Computer Communications and Networks, Las Vegas, September 1997, 4-10.
  36. M. Yamashita, H. Umemoto, I. Suzuki, and T. Kameda, Searching for mobile intruders in a polynomial region by a group of mobile searchers, Proc. ACM Symp. on Computational Geometry, 1997.
  37. V. Ng and T. Kameda, Quad-B tree for point data, Int'l Symp. on Cooperative Database Systems for Advanced Applications, Kyoto, Japan, Dec. 1996, 12-18.
  38. M. Yamashita and T. Kameda, Computing functions on asynchronous anonymous networks, Mathematical Systems Theory, vol. 29 (1996), 331-356.
  39. H. Nagamochi and T. Kameda, Constructing cactus representation for all minimum cuts in an undirected network, Operations Research Society of Japan, vol.39, no. 2, 1996, 135-158.
  40. M. Yamashita and T. Kameda, Computing on anonymous networks: Parts I and II, IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1 (Feb. 1996), 69-96. PtI.pdf
  41. S. Fujita, T. Kameda and M. Yamashita, A resource assignment problem on graphs, Lecture Notes in Computer Science 1004, Dec. 1995, 418-427.
  42. A. Bar-noy, J. A. Garay, X. Deng, T. Kameda. Optimal amortized distributed consensus. Information and Computation, vol 120, no. 1 (July 1995), 93-100.
  43. T. Ibaraki, H. Nagamochi, and T. Kameda, Optimal coteries for rings and related networks, Distributed Computing 8, No. 4 (1995), 191-201
  44. T. Ibaraki, T. Kameda, and F. Preparata, Timer-channel assignment in an ATM switch, Proc. IECE of Japan SIGCOMP, Okinawa, Japan, June 1995, 41-50.
  45. S. Pilarski and T. Kameda, A Probabilistic Analysis of Test Response Compaction, Monograph, IEEE Press, March 1995.
  46. T. Kameda, J. Ting, and D. Fracchia, A guaranteed-rate channel allocation scheme and its application to delivery-on-demand of continuous media data, In Protocols for High Speed Networks IV, Neufeld and Ito, Eds., Chapman & Hall, 260-275, 1995.
  47. T. Kameda and M. Yamashita, Distributed Algorithms, Monograph, Kindai Kagaku-Sha, Publishing, Inc., Tokyo, July 1994.
Back to Dr. Kameda's Home Page