Christopher J. Hillar

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 11

Top Topics

Hopfield Networks

Sparse Representation

Top Venues

IEEE Trans. Inf. Theory

Publications

Giovanni Luca Marchetti, Christopher J. Hillar, Danica Kragic, Sophia Sanborn
Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks. COLT (2024)
Sophia Sanborn, Christian Shewmake, Bruno A. Olshausen, Christopher J. Hillar
Bispectral Neural Networks. ICLR (2023)
Charles J. Garfinkle, Christopher J. Hillar
On the Uniqueness and Stability of Dictionaries for Sparse Representation of Noisy Signals. IEEE Trans. Signal Process. 67 (23) (2019)
Christopher J. Hillar, Sarah Marzen
Revisiting Perceptual Distortion for Natural Images: Mean Discrete Structural Similarity Index. DCC (2017)
Charles J. Garfinkle, Christopher J. Hillar
Robust Identifiability in Sparse Dictionary Learning. CoRR (2016)
Christopher J. Hillar, Abraham Martín del Campo
Corrigendum to "Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals" [J. Symb. Comput. 50(March 2013) 314-334]. J. Symb. Comput. 74 (2016)
Nickolas Hein, Christopher J. Hillar, Abraham Martín del Campo, Frank Sottile, Zach Teitler
The Monotone Secant Conjecture in the Real Schubert Calculus. Exp. Math. 24 (3) (2015)
Christopher J. Hillar, Felix Effenberger
Robust Discovery of Temporal Structure in Multi-neuron Recordings Using Hopfield Networks. INNS Conference on Big Data (2015)
Ram Mehta, Sarah Marzen, Christopher J. Hillar
Exploring discrete approaches to lossy compression schemes for natural image patches. EUSIPCO (2015)
Christopher J. Hillar, Friedrich T. Sommer
When Can Dictionary Learning Uniquely Recover Sparse Data From Subsamples? IEEE Trans. Inf. Theory 61 (11) (2015)
Felix Effenberger, Christopher J. Hillar
Discovery of Salient Low-Dimensional Dynamical Structure in Neuronal Population Activity Using Hopfield Networks. SIMBAD (2015)
Christopher J. Hillar, Ram Mehta, Kilian Koepsell
A hopfield recurrent neural network trained on natural images performs state-of-the-art image compression. ICIP (2014)
Christopher J. Hillar, Lek-Heng Lim
Most Tensor Problems Are NP-Hard. J. ACM 60 (6) (2013)
Christopher J. Hillar, Abraham Martín del Campo
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. J. Symb. Comput. 50 (2013)
Christopher J. Hillar, Frank Sottile
Complex Static Skew-Symmetric Output Feedback Control. SIAM J. Control. Optim. 51 (4) (2013)
Luis David García-Puente, Nickolas Hein, Christopher J. Hillar, Abraham Martín del Campo, James Ruffo, Frank Sottile, Zach Teitler
The Secant Conjecture in the Real Schubert Calculus. Exp. Math. 21 (3) (2012)
Osbert Bastani, Christopher J. Hillar, Dimitar Popov, J. Maurice Rojas
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond. CoRR (2011)
William K. Coulter, Christopher J. Hillar, Guy Isley, Friedrich T. Sommer
Adaptive compressed sensing - A new class of self-organizing coding models for neuroscience. ICASSP (2010)
Jesús A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar
Recognizing Graph Theoretic Properties with Polynomial Ideals. Electron. J. Comb. 17 (1) (2010)
Guy Isley, Christopher J. Hillar, Friedrich T. Sommer
Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication. NIPS (2010)
Christopher J. Hillar
Problem 11446. Am. Math. Mon. 116 (7) (2009)
Christopher J. Hillar, Bruce S. Burdick, Roger Williams
Polynomials Not Associated with Symmetric Matrices: 11321 [2007, 835]. Am. Math. Mon. 116 (7) (2009)
Christopher J. Hillar
Problem 11422. Am. Math. Mon. 116 (3) (2009)
Christopher J. Hillar, Saïd Amghibech
A Polynomial Identity: 11288 [2007, 359]. Am. Math. Mon. 116 (5) (2009)
Christopher J. Hillar, Lek-Heng Lim
Most tensor problems are NP hard CoRR (2009)
Christopher J. Hillar, Troels Windfeldt
Algebraic characterization of uniquely vertex colorable graphs. J. Comb. Theory, Ser. B 98 (2) (2008)
Christopher J. Hillar, Lionel Levine, Stephen C. Locke
Snapshots for Velocities: 11223. Am. Math. Mon. 115 (1) (2008)
Matthias Aschenbrenner, Christopher J. Hillar
An algorithm for finding symmetric Grobner bases in infinite dimensional rings. ISSAC (2008)
Christopher J. Hillar, Lionel Levine
Problem 11377. Am. Math. Mon. 115 (7) (2008)
Christopher J. Hillar, O. P. Lossers
A Group In Which Equations Are Solvable: 11231. Am. Math. Mon. 115 (7) (2008)
Christopher J. Hillar
Problem 11346. Am. Math. Mon. 115 (2) (2008)
Christopher J. Hillar
Problem 11321. Am. Math. Mon. 114 (9) (2007)
Christopher J. Hillar, Darren L. Rhea
Automorphisms of Finite Abelian Groups. Am. Math. Mon. 114 (10) (2007)
Christopher J. Hillar, Troels Windfeldt
Problem 11288. Am. Math. Mon. 114 (4) (2007)
Christopher J. Hillar, John H. Lindsey II, Robin Chapman
The Trace of the Sum of All Products of Two Matrices: 11204. Am. Math. Mon. 114 (9) (2007)
Christopher J. Hillar, Lionel Levine
Problem 11123. Am. Math. Mon. 113 (5) (2006)
Christopher J. Hillar
Problem 11204. Am. Math. Mon. 113 (2) (2006)
Christopher J. Hillar
Problem 11231. Am. Math. Mon. 113 (6) (2006)
Christopher J. Hillar, Darren L. Rhea
A result about the density of iterated line intersections in the plane. Comput. Geom. 33 (3) (2006)
Christopher J. Hillar, Darren L. Rhea, Godfrey L. Isaacs
An Oldie: 11098. Am. Math. Mon. 113 (2) (2006)
Christopher J. Hillar
Erratum to "Cyclic resultants" [J. Symbolic Comput. 39 (6) (2005) 653-669]. J. Symb. Comput. 40 (3) (2005)
Christopher J. Hillar
Cyclic resultants. J. Symb. Comput. 39 (6) (2005)
Christopher J. Hillar, Darren L. Rhea
Problem 11098. Am. Math. Mon. 111 (7) (2004)
Christopher J. Hillar, Patrick J. Fitzsimmons
Convergent Series with Exponents: 10928. Am. Math. Mon. 110 (5) (2003)
Charles R. Johnson, Christopher J. Hillar
Eigenvalues of Words in Two Positive Definite Letters. SIAM J. Matrix Anal. Appl. 23 (4) (2002)
Christopher J. Hillar
Problem 10928. Am. Math. Mon. 109 (3) (2002)
Christopher J. Hillar, Heinz-Jürgen Seiffert
Two Sums That Are Congruent Modulo p: 10723. Am. Math. Mon. 108 (2) (2001)