Cuckoo search

Results: 47



#Item
1Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2007-11-16 13:42:30
2Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:16
3SILT: A Memory-Efficient, High-Performance Key-Value Store

SILT: A Memory-Efficient, High-Performance Key-Value Store

Add to Reading List

Source URL: www.sigops.org

Language: English - Date: 2011-09-20 03:36:42
4Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-04-08 04:06:04
5SILT: A Memory-Efficient, High-Performance Key-Value Store

SILT: A Memory-Efficient, High-Performance Key-Value Store

Add to Reading List

Source URL: www.sigops.org

Language: English - Date: 2011-09-11 16:39:03
6Cuckoo Filter: Practically Better Than Bloom Bin Fan, David G. Andersen, Michael Kaminsky† , Michael D. Mitzenmacher‡ Carnegie Mellon University, † Intel Labs, ‡ Harvard University {binfan,dga}@cs.cmu.edu, michae

Cuckoo Filter: Practically Better Than Bloom Bin Fan, David G. Andersen, Michael Kaminsky† , Michael D. Mitzenmacher‡ Carnegie Mellon University, † Intel Labs, ‡ Harvard University {binfan,dga}@cs.cmu.edu, michae

Add to Reading List

Source URL: conferences2.sigcomm.org

Language: English - Date: 2014-12-01 16:58:59
7Algorithms and Data Structures Winter TermExercises for Unit 11 s 1. For this question assume we have n buckets, B1 , . . . , Bn , initially empty, and an unlimited

Algorithms and Data Structures Winter TermExercises for Unit 11 s 1. For this question assume we have n buckets, B1 , . . . , Bn , initially empty, and an unlimited

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-07 07:14:38
8Nordic Collegiate Programming Contest NCPC 2007 October 6th, 2007 The Problemset A B

Nordic Collegiate Programming Contest NCPC 2007 October 6th, 2007 The Problemset A B

Add to Reading List

Source URL: ncpc.idi.ntnu.no

Language: English - Date: 2014-01-20 12:10:57
9Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing?

Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing?

Add to Reading List

Source URL: judy.sourceforge.net

Language: English - Date: 2004-09-10 16:20:39
10A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams  117 A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams

A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams 117 A Heaviest Hitters Limiting Mechanism with O(1) Time Complexity for Sliding-Window Data Streams

Add to Reading List

Source URL: utopia.duth.gr

Language: English