![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Terumasa Aoki Thitiporn Lertrusdachakul , Akinori Taguchi , Terumasa Aoki, Hiroshi Yasuda : Image Arrangement Paradigm for Eye Contact Videoconference. MMM 2004 : 366 Juan D. Velásquez , Hiroshi Yasuda , Terumasa Aoki: Combining the web content and usage mining to understand the visitor behavior in a web site. ICDM 2003 : 669-672 Juan D. Velásquez , Hiroshi Yasuda , Terumasa Aoki, Richard Weber , Eduardo Vera : Using Self Organizing Feature Maps to Acquire Knowledge about Visitor Behavior in a Web Site. KES 2003 : 951-958 Juan D. Velásquez , Hiroshi Yasuda , Terumasa Aoki, Richard Weber : Using the KDD Process to Support Web Site Reconfigurations. Web Intelligence 2003 : 511-515 Juan D. Velásquez , Hiroshi Yasuda , Terumasa Aoki, Richard Weber : Voice Codification using Self Organizing Maps as Data Mining Tool. HIS 2002 : 480-489 Soichiro Hidaka , Terumasa Aoki, Hitoshi Aida , Tadao Saito : Implementation and performance evaluation of a FIFO queue class library for time warp. Systems and Computers in Japan 33 (9): 90-98 (2002) Reiko Osada , Terumasa Aoki, Hiroshi Yasuda : A Vector Coding Method for Natural Images. AIPR 2000 : 146-152 Susumu Yoneda , Terumasa Aoki: Simple IP Network Based on QoS Free Concept. ICC (2) 2000 : 701-707 Kustarto Widoyo , Terumasa Aoki, Hiroshi Yasuda : Demand Inquiring Service: A Network Service Based on Application Demands and Network Condition. IWAN 2000 : 385-397 Soichiro Hidaka , Terumasa Aoki, Hitoshi Aida , Tadao Saito : A FIFO Queue Class Library as a State Variable of Time Warp Logical Processes. ISCOPE 1998 : 151-158 1 [ 1 ] [ 5 ] 2 [ 1 ] [ 5 ] 3 [ 10 ] 4 [ 4 ] 5 [ 1 ] [ 5 ] 6 [ 10 ] 7 [ 6 ] [ 7 ] [ 8 ] [ 9 ] 8 [ 8 ] 9 [ 6 ] [ 7 ] [ 8 ] 10 [ 2 ] 11 [ 2 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 12 [ 3 ] ![]() ©2004 Association for Computing Machinery |