Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
Jingbo Zhu, Na Ye, Xinzhi Chang, Wenliang Chen, Be...
Shared workspace systems provide virtual places for selforganized and semi-structured cooperation between local and distributed team members. These cooperation systems have been a...
In order to perform daily maintenance and repair tasks in complex electrical and mechanical systems, technicians commonly utilize a large number of diagrams and documents detailin...
SungYe Kim, Insoo Woo, Ross Maciejewski, David S. ...