We present a system that enables flexible and efficient phrase matching in XML documents. Since XML allows structured and unstructured information to be interleaved, phrase matchi...
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 ...
We present the first report of automatic sentiment summarization in the legal domain. This work is based on processing a set of legal questions with a system consisting of a semi...
Jack G. Conrad, Jochen L. Leidner, Frank Schilder,...
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...
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...