855 search results - page 80 / 171 » Complexity of Equations over Sets of Natural Numbers |
SEMWEB
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Ontology matching consists of finding correspondences between ontology entities. OAEI campaigns aim at comparing ontology matching systems on precisely defined test set...
ENTCS
2007
14 years 9 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
MOC
2002
14 years 9 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...