4 citations · 7 across the 5 of their papers we have counts for
5 papers
Solving Boltzmann Optimization Problems with Deep Learning
Fiona Knoll, John T. Daly, Jess J. Meyer
Decades of exponential scaling in high performance computing (HPC) efficiency is coming to an end. Transistor based logic in complementary metal-oxide semiconductor (CMOS) technolo…
Optimal Bounds for Johnson-Lindenstrauss Transformations
Michael Burr, Shuhong Gao, Fiona Knoll
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclid…
Codes for distributed storage from 3-regular graphs
Shuhong Gao, Fiona Knoll, Felice Manganiello +1
This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3- regular graph into P4 pa…
Split Domination, Independence, and Irredundance in Graphs
Stephen Hedetniemi, Fiona Knoll, Renu Laskar
In 1978, Kulli and Janakiram \citep{KulliJanakiramSplit} defined the split dominating set: a dominating set of vertices in a graph is called {\em split dominating}…
Cycle Domination, Independence and Irredundance in graphs
Amy Grady, Fiona Knoll, Renu Laskar +1
A set of vertices in a graph is called {\em cycle independent} if the induced subgraph is acyclic, and called {\em odd-cycle indepdendet} if $\l…