Dustin G. Mixon

Orcid: 0000-0003-2743-7010

According to our database1, Dustin G. Mixon authored at least 71 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stable Coorbit Embeddings of Orbifold Quotients.
CoRR, 2024

2023
Max filtering with reflection groups.
Adv. Comput. Math., December, 2023

Bilipschitz group invariants.
CoRR, 2023

2022
Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps.
SIAM J. Matrix Anal. Appl., 2022

Doubly transitive lines I: Higman pairs and roux.
J. Comb. Theory, Ser. A, 2022

Frames over finite fields: Basic theory and equiangular lines in unitary geometry.
Finite Fields Their Appl., 2022

The Optimal Packing of Eight Points in the Real Projective Plane.
Exp. Math., 2022

Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices.
CoRR, 2022

Injectivity, stability, and positive definiteness of max filtering.
CoRR, 2022

Sketch-and-solve approaches to k-means clustering by semidefinite programming.
CoRR, 2022

Group-invariant max filtering.
CoRR, 2022

A Note on Totally Symmetric Equi-Isoclinic Tight Fusion Frames.
Proceedings of the IEEE International Conference on Acoustics, 2022

2021
Sketching Semidefinite Programs for Faster Clustering.
IEEE Trans. Inf. Theory, 2021

Globally Optimizing Small Codes in Real Projective Spaces.
SIAM J. Discret. Math., 2021

Asymptotic Frame Theory for Analog Coding.
Found. Trends Commun. Inf. Theory, 2021

Harmonic Grassmannian codes.
CoRR, 2021

A note on tight projective 2-designs.
CoRR, 2021

2020
SqueezeFit: Label-Aware Dimensionality Reduction by Semidefinite Programming.
IEEE Trans. Inf. Theory, 2020

Matching Component Analysis for Transfer Learning.
SIAM J. Math. Data Sci., 2020

Optimal Line Packings from Nonabelian Groups.
Discret. Comput. Geom., 2020

Neural collapse with unconstrained features.
CoRR, 2020

Uniquely optimal codes of low complexity are symmetric.
CoRR, 2020

Parameter estimation in the SIR model from early infections.
CoRR, 2020

Lie PCA: Density estimation for symmetric manifolds.
CoRR, 2020

2019
Fair redistricting is hard.
Theor. Comput. Sci., 2019

Derandomizing Compressed Sensing With Combinatorial Design.
Frontiers Appl. Math. Stat., 2019

Derandomized compressed sensing with nonuniform guarantees for 𝓁<sub>1</sub> recovery.
CoRR, 2019

Linear programming bounds for cliques in Paley graphs.
CoRR, 2019

Doubly transitive lines II: Almost simple symmetries.
CoRR, 2019

Kesten-McKay law for random subensembles of Paley equiangular tight frames.
CoRR, 2019

A Delsarte-Style Proof of the Bukh-Cox Bound.
CoRR, 2019

Exact Line Packings from Numerical Solutions.
CoRR, 2019

2018
An Impossibility Theorem for Gerrymandering.
Am. Math. Mon., 2018

Packings in Real Projective Spaces.
SIAM J. Appl. Algebra Geom., 2018

Tremain equiangular tight frames.
J. Comb. Theory, Ser. A, 2018

Partisan gerrymandering with geographically compact districts.
J. Appl. Probab., 2018

Utility Ghost: Gamified redistricting with partisan symmetry.
CoRR, 2018

SUNLayer: Stable denoising with generative networks.
CoRR, 2018

2017
Connectivity and Irreducibility of Algebraic Varieties of Finite Unit Norm Tight Frames.
SIAM J. Appl. Algebra Geom., 2017

Probably certifiably correct k-means clustering.
Math. Program., 2017

2016
Equiangular Tight Frames From Hyperovals.
IEEE Trans. Inf. Theory, 2016

Recent Advances in Phase Retrieval [Lecture Notes].
IEEE Signal Process. Mag., 2016

Clustering subgaussian mixtures by semidefinite programming.
CoRR, 2016

Clustering subgaussian mixtures with k-means.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

2015
Compressive Hyperspectral Imaging for Stellar Spectroscopy.
IEEE Signal Process. Lett., 2015

Sparse Phase Retrieval from Short-Time Fourier Measurements.
IEEE Signal Process. Lett., 2015

Learning Boolean functions with concentrated spectra.
CoRR, 2015

On the tightness of an SDP relaxation of k-means.
CoRR, 2015

Tables of the existence of equiangular tight frames.
CoRR, 2015

Discrete uncertainty principles and sparse signal processing.
CoRR, 2015

2014
Kirkman Equiangular Tight Frames and Codes.
IEEE Trans. Inf. Theory, 2014

Images as Occlusions of Textures: A Framework for Segmentation.
IEEE Trans. Image Process., 2014

Phase Retrieval with Polarization.
SIAM J. Imaging Sci., 2014

Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck.
CoRR, 2014

Phase Transitions in Phase Retrieval.
CoRR, 2014

Robust width: A characterization of uniformly stable and robust compressed sensing.
CoRR, 2014

Compressive classification and the rare eclipse problem.
CoRR, 2014

A conditional construction of restricted isometries.
CoRR, 2014

Derandomizing restricted isometries via the Legendre symbol.
CoRR, 2014

A Multiple Hypothesis Testing Approach to Low-Complexity Subspace Unmixing.
CoRR, 2014

2013
Fingerprinting With Equiangular Tight Frames.
IEEE Trans. Inf. Theory, 2013

Certifying the Restricted Isometry Property is Hard.
IEEE Trans. Inf. Theory, 2013

Phase retrieval from power spectra of masked signals
CoRR, 2013

Phase retrieval from very few measurements.
CoRR, 2013

Near-optimal phase retrieval of sparse vectors.
CoRR, 2013

Constructing all self-adjoint matrices with prescribed spectrum and diagonal.
Adv. Comput. Math., 2013

2012
Sparse Signal Processing with Frame Theory
CoRR, 2012

Group model selection using marginal correlations: The good, the bad and the Ugly.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Filter Bank Fusion Frames.
IEEE Trans. Signal Process., 2011

Frame coherence and sparse signal processing.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Equiangular tight frame fingerprinting codes.
Proceedings of the IEEE International Conference on Acoustics, 2011


  Loading...