Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
Future CSCL technologies are described by the community as flexible, tailorable, negotiable, and appropriate for various collaborative settings, conditions and contexts. This paper...
Despite the widespread deployment of malwaredetection software, in many situations it is difficult to preemptively block a malicious program from infecting a system. Rather, signa...
Roberto Paleari, Lorenzo Martignoni, Emanuele Pass...
Abstract—Tor is a well-known low-latency anonymous communication system that is able to bypass Internet censorship. However, publicly announced Tor routers are being blocked by v...
Zhen Ling, Junzhou Luo, Wei Yu, Ming Yang, Xinwen ...
In television shows, we are familiar with the sound of artificial laughter, the so called “canned laughter” or “laugh track”. It generally has an enhancing effect on the v...