We present a domain-independent unsupervised topic segmentation approach based on hybrid document indexing. Lexical chains have been successfully employed to evaluate lexical cohe...
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
In this paper, we propose a novel technique to segment handwritten document images into text lines by shredding their surface with local minima tracers. Our approach is based on t...
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...