Picture for Andres Gomez

Andres Gomez

for the ALICE Collaboration

Solution Path of Time-varying Markov Random Fields with Discrete Regularization

Add code
Jul 25, 2023
Viaarxiv icon

Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems

Add code
Aug 05, 2021
Figure 1 for Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems
Figure 2 for Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems
Figure 3 for Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems
Figure 4 for Memory-Aware Partitioning of Machine Learning Applications for Optimal Energy Use in Batteryless Systems
Viaarxiv icon

Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees

Add code
Feb 06, 2021
Figure 1 for Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees
Figure 2 for Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees
Figure 3 for Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees
Figure 4 for Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees
Viaarxiv icon

Supermodularity and valid inequalities for quadratic optimization with indicators

Add code
Dec 29, 2020
Figure 1 for Supermodularity and valid inequalities for quadratic optimization with indicators
Figure 2 for Supermodularity and valid inequalities for quadratic optimization with indicators
Figure 3 for Supermodularity and valid inequalities for quadratic optimization with indicators
Figure 4 for Supermodularity and valid inequalities for quadratic optimization with indicators
Viaarxiv icon

Ideal formulations for constrained convex optimization problems with indicator variables

Add code
Jun 30, 2020
Figure 1 for Ideal formulations for constrained convex optimization problems with indicator variables
Figure 2 for Ideal formulations for constrained convex optimization problems with indicator variables
Figure 3 for Ideal formulations for constrained convex optimization problems with indicator variables
Figure 4 for Ideal formulations for constrained convex optimization problems with indicator variables
Viaarxiv icon

Learning Optimal Classification Trees: Strong Max-Flow Formulations

Add code
Feb 21, 2020
Figure 1 for Learning Optimal Classification Trees: Strong Max-Flow Formulations
Figure 2 for Learning Optimal Classification Trees: Strong Max-Flow Formulations
Figure 3 for Learning Optimal Classification Trees: Strong Max-Flow Formulations
Figure 4 for Learning Optimal Classification Trees: Strong Max-Flow Formulations
Viaarxiv icon

Rank-one Convexification for Sparse Regression

Add code
Jan 29, 2019
Figure 1 for Rank-one Convexification for Sparse Regression
Figure 2 for Rank-one Convexification for Sparse Regression
Figure 3 for Rank-one Convexification for Sparse Regression
Figure 4 for Rank-one Convexification for Sparse Regression
Viaarxiv icon

Sparse and Smooth Signal Estimation: Convexification of L0 Formulations

Add code
Nov 06, 2018
Figure 1 for Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
Figure 2 for Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
Figure 3 for Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
Figure 4 for Sparse and Smooth Signal Estimation: Convexification of L0 Formulations
Viaarxiv icon

Intrusion Prevention and Detection in Grid Computing - The ALICE Case

Add code
Apr 20, 2017
Figure 1 for Intrusion Prevention and Detection in Grid Computing - The ALICE Case
Figure 2 for Intrusion Prevention and Detection in Grid Computing - The ALICE Case
Figure 3 for Intrusion Prevention and Detection in Grid Computing - The ALICE Case
Figure 4 for Intrusion Prevention and Detection in Grid Computing - The ALICE Case
Viaarxiv icon