chrundle Goto Github PK

followers: 15.0 following: 1.0 repos: 27.0 gists: 0.0

Name: James Diffenderfer

Type: User

Company: Lawrence Livermore National Laboratory, @LLNL

Bio: Staff Computational Scientist in CASC @LLNL. Focusing on Approximate Computing, Machine Learning, and Numerical Optimization.

Location: San Francisco, CA

Blog: https://www.linkedin.com/in/james-diffenderfer/

James Diffenderfer's Projects

binary-search

C++ implementation of binary search for sorted array.

binary-tree-breadth-first-search

C++ implementation of breadth first search for binary trees.

biprop

Identify a binary weight or binary weight and activation subnetwork within a randomly initialized network by only pruning and binarizing the network.

campaigning-after-redistricting

Model congressional campaign outcomes using neural network with Keras with TensorFlow. Then use campaign outcome model in a two-stage stochastic program model with recourse to examine how redistricting and funding a political campaign aﬀect the outcome of a two-party congressional election.

cholesky-factorization

C++ implementation of Cholesky factorization

ctypes-demo

Small sample problem for calling C function with user defined struct from python

cython-demo

Small sample problem for calling C function with user defined struct from python using Cython

diffenderfer2021winning_robustbench

Addition of models from Winning Hand paper to Robustbench

docker-suiteopt

Docker container for running SuiteOPT with Python

gaussian-elimination

C++ implementation of LU Factorization with partial pivoting

gram-schmidt

C++ implementation of Modified Gram-Schmidt orthogonalization procedure

hello-world

My first repository

hessenberg-form

C++ implementation of Householder Reduction to Hessenberg Form

householder-qr

C++ implementation of Householder QR Factorization

insertion-sort

C++ implementation of insertion sort for arrays

keywordcounter

Program for determining most popular keywords used in a search engine. Requires use of Fibonacci heap and hash table.

merge-sort

C++ implementation of merge sort for arrays

midpoint

C implementation of Midpoint method for computing root of continuous function

min-heap-arrays

Implementation of min heap whose elements are one dimensional arrays containing two elements. The elements are sorted in the min heap by the first entry in each array.