We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Abstract— For mobile robots, as well as other learning systems, the ability to highlight unexpected features of their environment – novelty detection – is very useful. One pa...
Paul A. Crook, Stephen Marsland, Gillian Hayes, Ul...
In this paper we report our research on building WebSail { an intelligent web search engine that is able to perform real-time adaptive learning. WebSail learns from the user'...
Zhixiang Chen, Xiannong Meng, Binhai Zhu, Richard ...
Abstract. We propose a novel approach for on-line signature verification based on building HMM user models by adapting an ergodic Universal Background Model (UBM). State initializa...