Skip to main content

and
  1. No Access

    Article

    Experience in teaching quantum computing with hands-on programming labs

    As the field of quantum computing rapidly advances, there is a growing demand for skilled professionals adept in quantum computing and programming. Recognizing this need, in this paper, we share our experience...

    Federico Galetto, Hiram H. López, Mehdi Rahmati in The Journal of Supercomputing (2024)

  2. No Access

    Chapter and Conference Paper

    Fast and Accurate Wi-Fi Localization in Large-Scale Indoor Venues

    An interest and development of indoor localization has grown along with the scope of applications. In a large and crowded indoor venue, the population density of access points (APs) is typically much higher th...

    Seokseong Jeon, Young-Joo Suh, Chansu Yu in Mobile and Ubiquitous Systems: Computing, … (2014)

  3. No Access

    Article

    Scanless fast handoff technique based on global Path-Cache for WLANs

    Wireless LANs (WLANs) have been widely adopted and are more convenient as they are interconnected as wireless campus networks and wireless mesh networks. However, time-sensitive multimedia applications, which ...

    Weetit Wanalertlak, Ben Lee, Chansu Yu, Myungchul Kim in The Journal of Supercomputing (2013)

  4. No Access

    Article

    Behavior-based mobility prediction for seamless handoffs in mobile wireless networks

    The field of wireless networking has received unprecedented attention from the research community during the last decade due to its great potential to create new horizons for communicating beyond the Internet. Wi...

    Weetit Wanalertlak, Ben Lee, Chansu Yu, Myungchul Kim, Seung-Min Park in Wireless Networks (2011)

  5. No Access

    Article

    Adaptive multicast on mobile ad hoc networks using tree-based meshes with variable density of redundant paths

    Multicasting has been extensively studied for mobile ad hoc networks (MANETs) because it is fundamental to many ad hoc network applications requiring close collaboration of multiple nodes in a group. A general...

    Sangman Moh, Sang Jun Lee, Chansu Yu in Wireless Networks (2009)

  6. No Access

    Chapter and Conference Paper

    Tree-Based Multicast Meshes with Variable Density of Redundant Paths on Mobile Ad Hoc Networks

    This paper proposes an adaptive multicast scheme for mobile ad hoc networks, called tree-based mesh with k-hop redundant paths (TBM k ), in which path re...

    Sangman Moh, Sang Jun Lee, Chansu Yu in Wireless Algorithms, Systems, and Applications (2006)

  7. No Access

    Chapter and Conference Paper

    Robust Multipath Routing to Exploit Maximally Disjoint Paths for Wireless Ad Hoc Networks

    This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths. The key idea is to extend the route request (RREQ) m...

    Jungtae Kim, Sangman Moh, Ilyong Chung in Advanced Web and Network Technologies, and… (2006)

  8. No Access

    Chapter and Conference Paper

    Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors

    In most parallel algorithms, inter-processor communication cost is much more than computing cost within a processor. So, it is very important to reduce the amount of inter-processor communication. This paper pres...

    Sangman Moh, Chansu Yu, Dongsoo Han in Computational Science and Its Applications… (2004)

  9. No Access

    Chapter and Conference Paper

    A Fast Tree-Based Barrier Synchronization on Switch-Based Irregular Networks

    In this paper, we propose a Barrier Tree for Irregular Networks (BTIN) and a barrier synchronization scheme using BTIN for switch-based cluster systems. The synchronization latency of the proposed BTIN scheme is ...

    Sangman Moh, Chansu Yu, Hee Yong Youn in High Performance Computing — HiPC 2000 (2000)

  10. No Access

    Chapter and Conference Paper

    Isomorphic Allocation in k-Ary n-Cube Systems

    Due to its topological generality and flexibility, the k-ary n-cube architecture is actively researched exploring network design tradeoffs as well as characterizing the topology. Processor allocation problem, whi...

    Moonsoo Kang, Chansu Yu in High Performance Computing – HiPC’99 (1999)