최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기IEEE communications letters : a publication of the IEEE Communications Society, v.19 no.11, 2015년, pp.1905 - 1908
Hyesook Lim (Dept. of Electron. Eng., Ewha Womans Univ., Seoul, South Korea) , Jungwon Lee (Dept. of Internet & Multimedia Eng., Konkuk Univ., Seoul, South Korea) , Changhoon Yim (Dept. of Internet & Multimedia Eng., Konkuk Univ., Seoul, South Korea)
The use of Bloom filters in network applications has increased rapidly. Since Bloom filters can produce false positives, the trueness of each positive needs to be identified by referring to an off-chip hash table. This letter proposes a new method for identifying the trueness of Bloom filter positiv...
Lim, Hyesook, Lee, Nara, Lee, Jungwon, Yim, Changhoon. Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters. Applied mathematics & information sciences : an international journal, vol.8, no.4, 1865-1877.
Ju Hyoung Mun, Hyesook Lim. New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms. IEEE transactions on computers, vol.65, no.5, 1558-1565.
0
Mitzenmacher, M.. Compressed Bloom filters. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.10, no.5, 604-612.
Lect Notes Comput Sci Less hashing, same performance: Building a better Bloom Filter kirsch 2006 10.1007/11841036_42 4168 456
Hyesook Lim, Kyuhee Lim, Nara Lee, Kyong-Hye Park. On Adding Bloom Filters to Longest Prefix Matching Algorithms. IEEE transactions on computers, vol.63, no.2, 411-423.
Zhang, Lixia, Afanasyev, Alexander, Burke, Jeffrey, Jacobson, Van, claffy, kc, Crowley, Patrick, Papadopoulos, Christos, Wang, Lan, Zhang, Beichuan. Named data networking. Computer communication review, vol.44, no.3, 66-73.
0
Rothenberg, Christian Esteve, Macapuna, Carlos A B, Verdi, Fábio L, Magalhães, Maurício F. The deletable Bloom filter: a new member of the Bloom family. IEEE communications letters : a publication of the IEEE Communications Society, vol.14, no.6, 557-559.
Bloom, Burton H.. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, vol.13, no.7, 422-426.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.