1262 search results - page 49 / 253 » Fast Robust Hashing |
105
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
91
Voted
CCCG
2010
15 years 2 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
99
Voted
SODA
1997
ACM
15 years 2 months ago
1997
ACM
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
126
Voted
TON
2010
14 years 7 months ago
2010
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...