When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...