Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Our understanding of IPv6 deployment is surprisingly limited. In fact, it is not even clear how we should quantify IPv6 deployment. In this paper, we collect and analyze a variety ...
Elliott Karpilovsky, Alexandre Gerber, Dan Pei, Je...
—In this paper RDFStats is introduced, which is a generator for statistics of RDF sources like SPARQL endpoints and RDF documents. RDFStats does not only provide a statistics gen...