### Web: http://arxiv.org/abs/2201.11085

Jan. 27, 2022, 2:11 a.m. | David Meredith

cs.LG updates on arXiv.org arxiv.org

We present a polynomial-time algorithm that discovers all maximal patterns in
a point set, $D\in\mathbb{R}^k$, that are related by transformations in a
user-specified class, $F$, of bijections over $\mathbb{R}^k$. We also present a
second algorithm that discovers the set of occurrences for each of these
maximal patterns and then uses compact encodings of these occurrence sets to
compute a losslessly compressed encoding of the input point set. This encoding
takes the form of a set of pairs, \$E=\left\lbrace\left\langle P_1,
T_1\right\rangle,\left\langle …

### Director, Data Engineering and Architecture

@ Chainalysis | California | New York | Washington DC | Remote - USA

### Deep Learning Researcher

@ Topaz Labs | Dallas, TX

### Sr Data Engineer (Contractor)

@ SADA | US - West

### Senior Cloud Database Administrator

@ Findhelp | Remote

### Senior Data Analyst

@ System1 | Remote

### Speech Machine Learning Research Engineer

@ Samsung Research America | Mountain View, CA