Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
The advent of the Internet has made the transmission of personally identifiable information common and often inadvertent to the user. As a consequence, individuals worry that comp...
Il-Horn Hann, Kai Lung Hui, Sang-Yong Tom Lee, Iva...
In this paper we propose a methodology to learn to extract domain-specific information from large repositories (e.g. the Web) with minimum user intervention. Learning is seeded b...
Fabio Ciravegna, Alexiei Dingli, David Guthrie, Yo...
Information Security awareness initiatives are seen as critical to any information security programme. But, how do we determine the effectiveness of these awareness initiatives? W...
: Most information in Hospitals is still only available in text format and the amount of this data is immensely increasing. Consequently, text mining is an essential area of medica...
Andreas Holzinger, Regina Geierhofer, Felix Mö...