Is min-wise hashing optimal for summarizing set intersection?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Rasmus Pagh, Morten Stöckel, David P. Woodruff
Is min-wise hashing optimal for summarizing set intersection?
PODS, 2014.

PODS 2014
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{PODS-2014-PaghSW,
	author        = "Rasmus Pagh and Morten Stöckel and David P. Woodruff",
	booktitle     = "{Proceedings of the 33rd Symposium on Principles of Database Systems}",
	doi           = "10.1145/2594538.2594554",
	isbn          = "978-1-4503-2375-8",
	pages         = "109--120",
	publisher     = "{ACM}",
	title         = "{Is min-wise hashing optimal for summarizing set intersection?}",
	year          = 2014,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.