|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Adam Kirsch, Michael Mitzenmacher |
The Power of One Move: Hashing Schemes for Hardware.  |
IEEE/ACM Trans. Netw.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Adam Kirsch, Eleni Drinea |
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications.  |
IEEE Transactions on Information Theory  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii |
The Hiring Problem and Lake Wobegon Strategies.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
More Robust Hashing: Cuckoo Hashing with a Stash.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin |
An efficient rigorous approach for identifying statistically significant frequent itemsets.  |
PODS  |
2009 |
DBLP DOI BibTeX RDF |
false discovery rate, multi-hypothesis test, poisson approximation, statistical significance, frequent itemset mining |
| 1 | Adam Kirsch, Michael Mitzenmacher |
Less hashing, same performance: Building a better Bloom filter.  |
Random Struct. Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher |
Simple summaries for hashing with choices.  |
IEEE/ACM Trans. Netw.  |
2008 |
DBLP DOI BibTeX RDF |
table lookup, hash tables, router architecture |
| 1 | Adam Kirsch, Michael Mitzenmacher, Udi Wieder |
More Robust Hashing: Cuckoo Hashing with a Stash.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii |
The hiring problem and Lake Wobegon strategies.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kirsch, Michael Mitzenmacher |
The Power of One Move: Hashing Schemes for Hardware.  |
INFOCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii |
On threshold behavior in query incentive networks.  |
ACM Conference on Electronic Commerce  |
2007 |
DBLP DOI BibTeX RDF |
query incentive networks, threshold phenomena, branching processes |
| 1 | Adam Kirsch, Michael Mitzenmacher |
Less Hashing, Same Performance: Building a Better Bloom Filter.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Anagnostopoulos, Adam Kirsch, Eli Upfal |
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input.  |
SIAM J. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Anagnostopoulos, Adam Kirsch, Eli Upfal |
Stability and Efficiency of a Random Local Load Balancing Protocol.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|