Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
Appropriate use of group consensus on service consumers’ QoS opinions can improve web service discovery. Web service participants with different backgrounds or preferences may n...
Wei-Li Lin, Chi-Chun Lo, Kuo-Ming Chao, Nick Godwi...
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...