Sciweavers

658 search results - page 84 / 132
» The Grindahl Hash Functions
Sort
View
111
Voted
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 16 days ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
PDCN
2007
15 years 2 months ago
Modified collision packet classification using counting bloom filter in tuple space
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
Mahmood Ahmadi, Stephan Wong
74
Voted
CIKM
2009
Springer
15 years 7 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
204
Voted
ITCC
2005
IEEE
15 years 6 months ago
A Lightweight Authentication Protocol for Mobile Ad Hoc Networks
The characteristics of mobile ad hoc networks (MANETs) determine that the authentication approaches to protect routing and data packet transmission in MANETs should be lightweight...
Bin Lu, Udo W. Pooch
113
Voted
GI
2004
Springer
15 years 6 months ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle