| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Jin Hyun Son Hyun Kyoo Park , Jin Hyun Son, Myoung-Ho Kim : Adaptive index management for future location-based queries. Journal of Systems and Software 74 (3): 313-324 (2005) Moonyoung Jung , Hak Soo Kim , Myung Hyun Jo , Kyung Hyun Tak , Hyun Suk Cha , Jin Hyun Son: Mapping from BPMN-Formed Business Processes to XPDL Business Processes. ICEB 2004 : 422-427 Jin Hyun Son, Myoung-Ho Kim : An adaptable vertical partitioning method in distributed systems. Journal of Systems and Software 73 (3): 551-561 (2004) Hyun Kyoo Park , Jin Hyun Son, Myoung-Ho Kim : An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments. Mobile Data Management 2003 : 78-91 Jin Hyun Son, Seok Kyun Oh , Kyung Hoon Choi , Yoon-Joon Lee , Myoung-Ho Kim : GM-WTA: An efficient workflow task allocation method in a distributed execution environment. Journal of Systems and Software 67 (3): 165-179 (2003) Duk-Ho Chang , Jin Hyun Son, Myoung-Ho Kim : Critical path identification in the context of a workflow. Information & Software Technology 44 (7): 405-417 (2002) Ki Yong Lee , Jin Hyun Son, Myoung-Ho Kim : Efficient Incremental View Maintenance in Data Warehouses. CIKM 2001 : 349-357 Jin Hyun Son, Myoung-Ho Kim : Analyzing the Critical Path for the Well-Formed Workflow Schema. DASFAA 2001 : 146-147 Jin Hyun Son, Myoung-Ho Kim : alpha-Partitioning Algorithm: Vertical Partitioning Based on the Fuzzy Graph. DEXA 2001 : 537-546 Jin Hyun Son, Jung Hoon Kim , Myoung-Ho Kim : Deadline Allocation in a Time-Constrained Workflow. Int. J. Cooperative Inf. Syst. 10 (4): 509-530 (2001) Jin Hyun Son, Myoung-Ho Kim : Improving the performance of time-constrained workflow processing. Journal of Systems and Software 58 (3): 211-219 (2001) Jin Hyun Son, Myoung-Ho Kim : Finding the critical path in a time-constrained workflow. RTCSA 2000 : 102-107 Jin Hyun Son, Jung Hoon Kim , Myoung-Ho Kim : Hard/Soft Deadline Assignment for High Workflow Throughput. DANTE 1999 : 359-365 1 [ 12 ] 2 [ 8 ] 3 [ 9 ] 4 [ 12 ] 5 [ 12 ] 6 [ 12 ] 7 [ 1 ] [ 4 ] 8 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] 9 [ 7 ] 10 [ 9 ] 11 [ 9 ] 12 [ 10 ] [ 13 ] 13 [ 12 ]  ©2005 Association for Computing Machinery |
