Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They suer from unequal dierential relevance of features in comput...