Information systems (IS) and software engineering (SE) have shared the domain of systems and software development for several decades with too little overlap in practice and resea...
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
This study is concerned with the application of multi-objective particle swarm optimization (MOPSO) approaches to the framework of collaborative fuzzy clustering. In particular, t...
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...