Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
To navigate reliably in indoor environments, a mobile robot must know where it is. This includes both the ability of globally localizing the robot from scratch, as well as trackin...
Frank Dellaert, Wolfram Burgard, Dieter Fox, Sebas...
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...