—Information can change rapidly on the web. For example, news may hint some new story starts to develop. Many more news related to the original event begin to pour in the web. Im...
- 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...
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
Traditional web service discovery is strongly related to the use of service directories. Especially in the case of mobile web services, where both service requestors and providers...
Traditional information retrieval models assume that users express their information needs via text queries (i.e., their "talk"). In this poster, we consider Web browsin...
Mikhail Bilenko, Ryen W. White, Matthew Richardson...