In this paper, we propose a tree-structured multiclass classifier to identify annotations and overlapping text from machine printed documents. Each node of the tree-structured cla...
—We introduce quantization feature functions to represent continuous or large range discrete data into the symbolic CRF data representation. We show that doing this convertion in...
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...