Jose Israel Rodriguez

Orcid: 0000-0003-3140-9944

According to our database1, Jose Israel Rodriguez authored at least 32 papers between 2013 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects.
CoRR, May, 2026

Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model.
CoRR, May, 2026

2025
Estimating Gaussian Mixtures Using Sparse Polynomial Moment Systems.
SIAM J. Math. Data Sci., 2025

Method of moments for Gaussian mixtures: Implementation and benchmarks.
Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, 2025

2024
Towards Learning the Positive Real Discriminant of the Wnt Signaling Pathway Shuttle Model.
ACM Commun. Comput. Algebra, September, 2024

A Maximum Likelihood Estimator for Quartets under the Cavender-Farris-Neyman Model.
ACM Commun. Comput. Algebra, June, 2024

Invariants of SDP exactness in quadratic programming.
J. Symb. Comput., May, 2024

u-generation: solving systems of polynomials equation-by-equation.
Numer. Algorithms, February, 2024

Activation thresholds and expressiveness of polynomial neural networks.
CoRR, 2024

2023
The Maximum Likelihood Degree of Sparse Polynomial Systems.
SIAM J. Appl. Algebra Geom., March, 2023

2022
Implementing real polyhedral homotopy.
CoRR, 2022

2021
Fiber product homotopy method for multiparameter eigenvalue problems.
Numerische Mathematik, 2021

Solving decomposable sparse systems.
Numer. Algorithms, 2021

A numerical toolkit for multiprojective varieties.
Math. Comput., 2021

2020
Euclidean Distance Degree of the Multiview Variety.
SIAM J. Appl. Algebra Geom., 2020

Decomposable sparse polynomial systems.
CoRR, 2020

Algebraic optimization degree.
ACM Commun. Comput. Algebra, 2020

MultiRegeneration for polynomial system solving.
ACM Commun. Comput. Algebra, 2020

Defect of Euclidean distance degree.
Adv. Appl. Math., 2020

A Numerical Approach for Computing Euler Characteristics of Affine Varieties.
Proceedings of the Mathematical Software - ICMS 2020, 2020

2019
The maximum likelihood degree of toric varieties.
J. Symb. Comput., 2019

2018
Numerical Computation of Galois Groups.
Found. Comput. Math., 2018

Homogenized funtf varieties and algebraic frame completion.
ACM Commun. Comput. Algebra, 2018

Solving the Likelihood Equations to Compute Euler Obstruction Functions.
Proceedings of the Mathematical Software - ICMS 2018, 2018

2017
The Maximum Likelihood Degree of Mixtures of Independence Models.
SIAM J. Appl. Algebra Geom., 2017

A probabilistic algorithm for computing data-discriminants of likelihood equations.
J. Symb. Comput., 2017

The maximum likelihood data singular locus.
J. Symb. Comput., 2017

2015
Combinatorial excess intersection.
J. Symb. Comput., 2015

Data-Discriminants of Likelihood Equations.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Maximum likelihood for dual varieties.
Proceedings of the Symbolic-Numeric Computation 2014, 2014

Maximum likelihood geometry in the presence of data zeros.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Bertini for Macaulay2.
CoRR, 2013


  Loading...