Sven Kosub
2016
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Sven Kosub trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Sven Kosub overall
Papers from Sven Kosub's perspective
Ordered by how strongly the researchers Sven Kosub trusts endorse each paper. Same corpus, a different order for every researcher.
- Similarity estimation techniques from rounding algorithms
- Distance between Sets
- A proof of the triangle inequality for the Tanimoto distance
- Clustering data streams (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Pattern classification and scene analysis
- Data-streams and histograms (Symposium on the Theory of Computing)
- Navigating nets: simple algorithms for proximity search (ACM-SIAM Symposium on Discrete Algorithms)
- Information Theory: 1948-1998 - Guest Editorial
- Locality-sensitive hashing scheme based on p-stable distributions
- A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
Their papers
- A note on the triangle inequality for the Jaccard distance (2016) — 246 citations