5372 search results - page 263 / 1075 » complexity 2007 |
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
ISPEC
2007
Springer
14 years 2 months ago
2007
Springer
Credentials are an indispensable means for service access control in electronic commerce. However, regular credentials such as X.509 certificates and SPKI/SDSI certificates do no...
KES
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
PAIRING
2007
Springer
14 years 2 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
Due to their increasing complexity, design of software systems is not becoming easier. Furthermore, modern applications ranging from enterprise to embedded systems require very hig...