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 ...
Connections is a file system search tool that combines traditional content-based search with context information gathered from user activity. By tracing file system calls, Conne...
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...
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
Evaluating the similarity of images and their descriptors by employing discriminative learners has proven itself to be an effective face recognition paradigm. In this paper we sho...