Brian Axelrod

Orcid: 0000-0001-8991-8915

According to our database1, Brian Axelrod authored at least 17 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
USE-Evaluator: Performance metrics for medical image segmentation models supervised by uncertain, small or empty reference annotations in neuroimaging.
Medical Image Anal., December, 2023

Random Expert Sampling for Deep Learning Segmentation of Acute Ischemic Stroke on Non-contrast CT.
CoRR, 2023

2022
Sidestepping hardness in statistical problems.
PhD thesis, 2022

Non-inferiority of Deep Learning Model to Segment Acute Stroke on Non-contrast CT Compared to Neuroradiologists.
CoRR, 2022

Evaluation of Medical Image Segmentation Models for Uncertain, Small or Empty Reference Annotations.
CoRR, 2022

On the Statistical Complexity of Sample Amplification.
CoRR, 2022

Efficient Motion Planning Under Obstacle Uncertainty with Local Dependencies.
Proceedings of the Algorithmic Foundations of Robotics XV, 2022

2021
Hardness of Motion Planning with Obstacle Uncertainty in Two Dimensions.
Int. J. Robotics Res., 2021

2020
Learning From Strategic Agents: Accuracy, Improvement, and Causality.
CoRR, 2020

Near-optimal Approximate Discrete and Continuous Submodular Function Minimization.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Causal Strategic Linear Regression.
Proceedings of the 37th International Conference on Machine Learning, 2020

Sample Amplification: Increasing Dataset Size even when Learning is Impossible.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Provably safe robot navigation with obstacle uncertainty.
Int. J. Robotics Res., 2018

An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood.
CoRR, 2018

Hardness of 3D Motion Planning Under Obstacle Uncertainty.
Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

2015
Reducing FPGA algorithm area by avoiding redundant computation.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015


  Loading...