Multi-resolution Hashing for Fast Pairwise Summations

A basic computational primitive in the analysis of massive datasets is summing simple functions over a large number of objects. Modern applications pose an additional challenge in that such functions often depend on a parameter vector y (query) that is unknown a priori. Given a set of points X and a...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / annual Symposium on Foundations of Computer Science s. 769 - 792
Hlavní autori:	Charikar, Moses, Siminelakis, Paris
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2019
Predmet:	Anomaly detection Approximation algorithms Computer science Data structures Harmonic analysis Hashing Importance Sampling Kernel Kernel Density Partition Function Estimation Partitioning algorithms Sub linear algorithms
ISSN:	2575-8454
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!