Sciweavers

873 search results - page 131 / 175
» step 2005
Sort
View
SACRYPT
2005
Springer
112views Cryptology» more  SACRYPT 2005»
15 years 5 months ago
Pairing-Friendly Elliptic Curves of Prime Order
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...
Paulo S. L. M. Barreto, Michael Naehrig
SEMWEB
2005
Springer
15 years 5 months ago
Bootstrapping Ontology Alignment Methods with APFEL
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 ...
Marc Ehrig, Steffen Staab, York Sure
SOFSEM
2005
Springer
15 years 5 months ago
RAQ: A Range-Queriable Distributed Data Structure
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...
Hamid Nazerzadeh, Mohammad Ghodsi
SPIRE
2005
Springer
15 years 5 months ago
Cache-Conscious Collision Resolution in String Hash Tables
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...
Nikolas Askitis, Justin Zobel
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 5 months ago
Constrained Shortest Path Computation
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...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...