Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
We study information reconciliation (IR) scheme for the quantum key distribution (QKD) protocols. The IR for the QKD can be considered as the asymmetric Slepian-Wolf problem, which...
Recently various data-driven spoken language technologies have been applied to spoken dialog system development. However, high cost of maintaining the spoken dialog systems is one ...
Donghyeon Lee, Kyungduk Kim, Cheongjae Lee, Junhwi...
Abstract. In exploratory learning environments, learners can use different strategies to solve a problem. To the designer or teacher, however, not all these strategies are known in...
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...