This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
Panagiotis D. Michailidis, Konstantinos G. Margari...
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...