Sciweavers

73 search results - page 3 / 15
» Perfect Hashing for Data Management Applications
Sort
View
GI
2004
Springer
13 years 11 months ago
On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios
Abstract: Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics â€...
Tobias Heer, Heiko Niedermayer, Leo Petrak, Simon ...
SIGCOMM
2005
ACM
13 years 11 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...
CIKM
2008
Springer
13 years 8 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
EUROPAR
2009
Springer
13 years 9 months ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
ICPR
2002
IEEE
13 years 11 months ago
Biometric Hash based on Statistical Features of Online Signatures
This paper presents a new approach to generate biometric hash values based on statistical features in online signature signals. Whilst the output of typical online signature verif...
Claus Vielhauer, Ralf Steinmetz, Astrid Mayerh&oum...