loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008)
Waikoloa, Big Island, Hawaii
January 07-January 10
ISBN: 0-7695-3075-3
ASCII Text
x 
 
Michael Wilder, Clinton Jeffery, "Towards Fast Incremental Hashing of Large Bit Vectors," Hawaii International Conference on System Sciences, pp. 474, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/HICSS.2008.509,
author = {Michael Wilder and Clinton Jeffery},
title = {Towards Fast Incremental Hashing of Large Bit Vectors},
journal ={Hawaii International Conference on System Sciences},
volume = {0},
year = {2008},
issn = {1530-1605},
pages = {474},
doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.2008.509},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Hawaii International Conference on System Sciences
TI - Towards Fast Incremental Hashing of Large Bit Vectors
SN - 1530-1605
SP
EP
A1 - Michael Wilder,
A1 - Clinton Jeffery,
PY - 2008
KW - null
VL - 0
JA - Hawaii International Conference on System Sciences
ER -
 
Many application domains require algorithmic support for collections of large bit vectors that are frequently referenced. In a compiler that performs type inferencing, this problem occurred in representing sets of possible types at each program point. This paper presents an incremental hashing technique that performs well in this domain.
Citation:
Michael Wilder, Clinton Jeffery, "Towards Fast Incremental Hashing of Large Bit Vectors," hicss, pp.474, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.