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...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 769 - 792
Main Authors:	Charikar, Moses, Siminelakis, Paris
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2019
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!