Sciweavers

1000 search results - page 179 / 200
» Dependency Tree Automata
Sort
View
IJCAI
1997
13 years 12 months ago
Machine Learning Techniques to Make Computers Easier to Use
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...
Hiroshi Motoda, Kenichi Yoshida
UAI
1996
13 years 12 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
AIPS
2009
13 years 11 months ago
Dynamic Controllability of Temporally-flexible Reactive Programs
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...
AAAI
2010
13 years 11 months ago
Reasoning about Imperfect Information Games in the Epistemic Situation Calculus
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...
Vaishak Belle, Gerhard Lakemeyer
ICMCS
2010
IEEE
168views Multimedia» more  ICMCS 2010»
13 years 11 months ago
Block-based image steganalysis for a multi-classifier
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...