scientific article
From MaRDI portal
Publication:3576759
zbMath1192.68959MaRDI QIDQ3576759
No author found.
Publication date: 2 August 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0110/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
Binary vectors for fast distance and similarity estimation ⋮ When distributed computation is communication expensive ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A unified scheme for generalizing cardinality estimators to sum aggregation ⋮ Sample complexity of the distinct elements problem ⋮ Measuring the impact of MVC attack in large complex networks ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Index structures for fast similarity search for binary vectors ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Improving MinHash via the containment index with applications to metagenomic analysis ⋮ Give me some slack: efficient network measurements ⋮ Order statistics and estimating cardinalities of massive data sets ⋮ Approximate set union via approximate randomization ⋮ Approximate set union via approximate randomization ⋮ Fast size approximation of a radio network in beeping model ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ HyperLogLog ⋮ Approximating the Size of a Radio Network in Beeping Model
This page was built for publication:
