1262 search results - page 51 / 253 » Fast Robust Hashing |
CORR
2008
Springer
15 years 25 days ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
102
click to vote
HPDC
2006
IEEE
15 years 6 months ago
2006
IEEE
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
140
click to vote
ICAPR
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
100
Voted
ADAC
2010
15 years 27 days ago
2010
We consider the problem of optimally separating two multivariate populations. Robust linear discriminant rules can be obtained by replacing the empirical means and covariance in th...
119
click to vote
CGF
2011
14 years 7 months ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard