- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
—The information that exists on the World Wide Web is enormous enough in order to distract the users when trying to find useful information. In order to overcome the large amount...
This paper presents BlogBuster, a tool for extracting a corpus from the blogosphere. The topic of cleaning arbitrary web pages with the goal of extracting a corpus from web data, ...
This paper reports our experience when integrating differ resources and services into a grid environment. The use case we address implies the deployment of several NLP application...
The Web is experiencing an exponential growth in the use of weblogs or blogs, websites containing dated journal-style entries. Blog entries are generally organised using informall...
Conor Hayes, Paolo Avesani, Sriharsha Veeramachane...