Deep learning interpretation - Flip points and homotopy methods. | 0 | 0.34 | 2020 |
Interpreting Neural Networks Using Flip Points. | 0 | 0.34 | 2019 |
Positive Filtered PN Moment Closures for Linear Kinetic Equations. | 0 | 0.34 | 2016 |
A Framework for Regularization via Operator Approximation | 3 | 0.47 | 2015 |
Gide: Graphical Image Deblurring Exploration | 1 | 0.40 | 2015 |
A Polynomial Time Constraint-Reduced Algorithm for Semidefinite Optimization Problems | 2 | 0.38 | 2015 |
Near-Optimal Spectral Filtering and Error Estimation for Solving Ill-Posed Problems | 1 | 0.36 | 2015 |
What's the Score? Matrices, Documents, and Queries. | 0 | 0.34 | 2014 |
Adaptive change of basis in entropy-based moment closures for linear kinetic equations | 4 | 0.49 | 2014 |
Phantom Measurements | 0 | 0.34 | 2013 |
Variable projection for nonlinear least squares problems | 19 | 1.08 | 2013 |
Optimal Filters from Calibration Data for Image Deconvolution with Data Acquisition Error. | 2 | 0.44 | 2012 |
A constraint-reduced variant of Mehrotra's predictor-corrector algorithm | 9 | 0.68 | 2012 |
Adaptive constraint reduction for convex quadratic programming | 7 | 0.46 | 2012 |
Light a Single Candle: Studying Supernovae | 0 | 0.34 | 2012 |
Variable-Geometry Trusses: What's Your Angle? | 0 | 0.34 | 2012 |
Scaling MPE Inference for Constrained Continuous Markov Random Fields with Consensus Optimization. | 7 | 0.47 | 2012 |
Euclidean distance matrix completion problems | 3 | 0.39 | 2012 |
Windowed Spectral Regularization of Inverse Problems | 2 | 0.38 | 2011 |
CLASSY 2011 at TAC: Guided and Multi-lingual Summaries and Evaluation Metrics. | 23 | 0.85 | 2011 |
Salient Frame Detection for Molecular Dynamics Simulations. | 0 | 0.34 | 2011 |
Ranking human and machine summarization systems | 9 | 0.61 | 2011 |
Nouveau-rouge: A novelty metric for update summarization | 15 | 1.03 | 2011 |
Guiding CLASSY Toward More Responsive Summaries. | 6 | 0.56 | 2010 |
Portfolio Selection Using Tikhonov Filtering to Estimate the Covariance Matrix | 1 | 0.36 | 2010 |
Locality bounds on hamiltonians for stabilizer codes | 0 | 0.34 | 2009 |
A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations | 2 | 0.38 | 2009 |
Gene Howard Golub, 1932–2007 | 0 | 0.34 | 2009 |
CLASSY 2009: Summarization and Metrics | 6 | 0.52 | 2009 |
Arabic/English multi-document summarization with CLASSY: the past and the future | 19 | 1.63 | 2008 |
Modified Cholesky algorithms: a catalog with new approaches | 6 | 0.85 | 2008 |
Universal duality in conic convex optimization | 0 | 0.34 | 2007 |
Beetles, Cannibalism, and Chaos: Analyzing a Dynamical System Model | 0 | 0.34 | 2007 |
A Partial Solution to Last Issue's Homework Assignment: Beetles, Cannibalism, and Chaos--Analyzing a Dynamical System Model | 0 | 0.34 | 2007 |
Fast robust regression algorithms for problems with Toeplitz structure | 2 | 0.41 | 2007 |
On sensitivity of Gauss–Christoffel quadrature | 9 | 0.83 | 2007 |
Measuring variability in sentence ordering for news summarization | 10 | 0.59 | 2007 |
Topic-focused multi-document summarization using an approximate oracle score | 50 | 2.96 | 2006 |
Sensitivity Analysis: When a Little Means a Lot | 1 | 0.38 | 2006 |
Updating and Downdating Matrix Factorizations: A Change in Plans | 1 | 0.58 | 2006 |
Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices | 3 | 0.47 | 2006 |
Multigrid Methods: Managing Massive Meshes | 0 | 0.34 | 2006 |
Efficient circuits for exact-universal computationwith qudits | 3 | 0.47 | 2006 |
Computer memory and arithmetic: a look under the hood | 0 | 0.34 | 2006 |
Computational software: writing your legacy | 0 | 0.34 | 2006 |
George Dantzig: a remembrance. | 0 | 0.34 | 2005 |
Blind deconvolution: errors, errors everywhere | 0 | 0.34 | 2005 |
Blind deconvolution: a matter of norm | 0 | 0.34 | 2005 |
Eigenvalues: valuable principles | 0 | 0.34 | 2005 |
Fast solvers and Sylvester equations: both sides now | 0 | 0.34 | 2005 |