Sciweavers

1080 search results - page 112 / 216
» Distributed Hash Tables
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
16 years 1 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
EUROPAR
1999
Springer
15 years 10 months ago
Multi-stage Cascaded Prediction
Two-level predictors deliver highly accurate conditional branch prediction, indirect branch target prediction and value prediction. Accurate prediction enables speculative executio...
Karel Driesen, Urs Hölzle
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
IJNSEC
2011
116views more  IJNSEC 2011»
15 years 1 months ago
An Authentication Protocol Based on Kerberos 5
We introduce some modifications to the widely deployed Kerberos authentication protocol. The principle’s secretkey will be independent of the user password to overcome the weak...
Eman El-Emam, Magdy Koutb, Hamdy Kelash, Osama S. ...
WDAS
2000
15 years 7 months ago
Scalable Distributed Data Structures: A Survey
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
Adriano Di Pasquale, Enrico Nardelli