Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Robe...
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
We seek to gain improved insight into how Web search engines should cope with the evolving Web, in an attempt to provide users with the most up-to-date results possible. For this ...
Alexandros Ntoulas, Junghoo Cho, Christopher Olsto...