A new streaming algorithm approximates k-graphlet distributions with O(1/c) passes and Õ(n^{1+c}) memory for any fixed c>0, improving on the prior O(log n) pass bound and shown to be near-optimal.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A Complex Autoencoder learns transformation-invariant magnitude representations from audio for state-of-the-art results in audio-to-score alignment and repeated section discovery.
citing papers explorer
-
An Efficient Streaming Algorithm for Approximating Graphlet Distributions
A new streaming algorithm approximates k-graphlet distributions with O(1/c) passes and Õ(n^{1+c}) memory for any fixed c>0, improving on the prior O(log n) pass bound and shown to be near-optimal.
-
Learning Complex Basis Functions for Invariant Representations of Audio
A Complex Autoencoder learns transformation-invariant magnitude representations from audio for state-of-the-art results in audio-to-score alignment and repeated section discovery.