Abstract. This paper presents a study of 25 structural features extracted from samples of grapheme `th' that correspond to features commonly used by forensic document examiner...
Traditional text classification algorithms are based on a basic assumption: the training and test data should hold the same distribution. However, this identical distribution assum...
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...