Sciweavers

455 search results - page 2 / 91
» Distributed Processes on Tree Hash
Sort
View
SIGCOMM
2005
ACM
13 years 11 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
IPPS
1998
IEEE
13 years 10 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
GLOBECOM
2008
IEEE
13 years 7 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
ICIP
2003
IEEE
14 years 7 months ago
Dither-based secure image hashing using distributed coding
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the ima...
Mark Johnson, Kannan Ramchandran