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 discuss a screening process used in conjunction with a survey administered via Amazon.com’s Mechanical Turk. We sought an easily implementable method to disqual...
Julie S. Downs, Mandy B. Holbrook, Steve Sheng, Lo...
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Information extraction systems have been dealt with at length from the viewpoint of users posing definite questions whose expected answer is to be found in a document collection. T...
There is a significant need for data integration capabilities in the scientific domain, which has manifested itself as products in the commercial world as well as academia. Howeve...
Brenton Louie, Landon Detwiler, Nilesh N. Dalvi, R...