Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
Robert T. Effinger, Brian C. Williams, Gerard Kell...
Approaches to reasoning about knowledge in imperfect information games typically involve an exhaustive description of the game, the dynamics characterized by a tree and the incomp...
Traditional image steganalysis techniques for classification of steganograhic algorithms are conducted with respect to the entire image. In this work, we aim to design a multi-cla...
Seongho Cho, Jingwei Wang, C.-C. Jay Kuo, Byung-Ho...