Even if a problem solving method and a domain ontology has been identified, there still remains the problem of adding sufficient and consistent domain knowledge to a knowledge proc...
Thorsten Liebig, Dieter Finkenzeller, Marko Luther
To increase the depth and appeal of computer games, the intelligence of the characters they contain needs to be increased. These characters should be played by intelligent agents ...
This paper presents a new approach to bitext correspondence problem (BCP) of noisy bilingual corpora based on image processing (IP) techniques. By using one of several ways of est...
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...
As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap....