Sciweavers

785 search results - page 18 / 157
» The Dynamic Bloom Filters
Sort
View
GLOBECOM
2008
IEEE
13 years 8 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,...
ICRA
2010
IEEE
170views Robotics» more  ICRA 2010»
13 years 6 months ago
Towards marine bloom trajectory prediction for AUV mission planning
— This paper presents an oceanographic toolchain that can be used to generate multi-vehicle robotic surveys for large-scale dynamic features in the coastal ocean. Our science app...
Jnaneshwar Das, Kanna Rajany, Sergey Frolovy, Fred...
SIGCOMM
2009
ACM
14 years 2 months ago
Hash, don't cache: fast packet forwarding for enterprise edge routers
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
Minlan Yu, Jennifer Rexford
VLDB
2004
ACM
180views Database» more  VLDB 2004»
14 years 27 days ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
JCST
2008
175views more  JCST 2008»
13 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang