Sciweavers

110 search results - page 2 / 22
» Performance analysis by topology indexed lookup tables
Sort
View
INFOCOM
2000
IEEE
13 years 10 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SIGCOMM
2005
ACM
13 years 12 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...
ICMCS
2006
IEEE
129views Multimedia» more  ICMCS 2006»
14 years 13 days ago
Minimum Distortion Look-Up Table Based Data Hiding
In this paper, we present a novel data hiding scheme based on the minimum distortion look-up table (LUT) embedding that achieves good distortion-robustness performance. We first ...
Xiaofeng Wang, Xiao-Ping Zhang
ICDAR
2011
IEEE
12 years 6 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
INFOCOM
2006
IEEE
14 years 13 days ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie