no code implementations • 18 Apr 2021 • Fangfang Xia, Jonathan Allen, Prasanna Balaprakash, Thomas Brettin, Cristina Garcia-Cardona, Austin Clyde, Judith Cohn, James Doroshow, Xiaotian Duan, Veronika Dubinkina, Yvonne Evrard, Ya Ju Fan, Jason Gans, Stewart He, Pinyi Lu, Sergei Maslov, Alexander Partin, Maulik Shukla, Eric Stahlberg, Justin M. Wozniak, Hyunseung Yoo, George Zaki, Yitan Zhu, Rick Stevens
To provide a more rigorous assessment of model generalizability between different studies, we use machine learning to analyze five publicly available cell line-based data sets: NCI60, CTRP, GDSC, CCLE and gCSI.
no code implementations • 23 Dec 2020 • Cristina Garcia-Cardona, M. Giselle Fernández-Godino, Daniel O'Malley, Tanmoy Bhattacharya
Simulation of the crack network evolution on high strain rate impact experiments performed in brittle materials is very compute-intensive.
no code implementations • 9 Sep 2017 • Cristina Garcia-Cardona, Brendt Wohlberg
Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters.
no code implementations • 31 Aug 2017 • Jialin Liu, Cristina Garcia-Cardona, Brendt Wohlberg, Wotao Yin
Convolutional sparse representations are a form of sparse representation with a structured, translation invariant dictionary.
no code implementations • 29 Jun 2017 • Jialin Liu, Cristina Garcia-Cardona, Brendt Wohlberg, Wotao Yin
While a number of different algorithms have recently been proposed for convolutional dictionary learning, this remains an expensive problem.
no code implementations • 6 Jun 2013 • Cristina Garcia-Cardona, Arjuna Flenner, Allon G. Percus
We present a graph-based variational algorithm for classification of high-dimensional data, generalizing the binary diffuse interface model to the case of multiple classes.
no code implementations • 11 Mar 2013 • Laura M. Smith, Kristina Lerman, Cristina Garcia-Cardona, Allon G. Percus, Rumi Ghosh
Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs.
no code implementations • 15 Feb 2013 • Cristina Garcia-Cardona, Ekaterina Merkurjev, Andrea L. Bertozzi, Arjuna Flenner, Allon Percus
We present two graph-based algorithms for multiclass segmentation of high-dimensional data.