Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
Abstract. Ontology alignment is a prerequisite in order to allow for interoperation between different ontologies and many alignment strategies have been proposed to facilitate the ...
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...