This paper is addressing the problem of realigning broken
objects without correspondences. We consider linear transformations between
the object fragments and present the method ...
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
In this paper we describe a prototype system for information retrieval on the Internet. Our idea is that the Web has to be searched both semantically and syntactically. In order t...
Carmine Cesarano, Antonio d'Acierno, Antonio Picar...
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...