251 results on '"Elias P. Tsigaridas"'
Search Results
2. Randomized geometric tools for anomaly detection in stock markets.
3. Geometric algorithms for sampling the flux space of metabolic networks.
4. Condition numbers for the cube. I: Univariate polynomials and hypersurfaces.
5. PTOPO: Computing the geometry and the topology of parametric curves.
6. On the Complexity of Chow and Hurwitz Forms.
7. Truncated Log-concave Sampling for Convex Bodies with Reflective Hamiltonian Monte Carlo.
8. Trifocal Relative Pose From Lines at Points.
9. Segre-driven radicality testing.
10. GPU-Based Homotopy Continuation for Minimal Problems in Computer Vision.
11. Beyond Worst-Case Analysis for Root Isolation Algorithms.
12. The Multivariate Schwartz-Zippel Lemma.
13. Semidefinite network games: multiplayer minimax and semidefinite complementarity problems.
14. Geometric Algorithms for Sampling the Flux Space of Metabolic Networks.
15. TRPLP - Trifocal Relative Pose From Lines at Points.
16. On the geometry and the topology of parametric curves.
17. Condition numbers for the cube: i: Univariate polynomials and hypersurfaces.
18. On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2.
19. A nearly optimal algorithm to decompose binary forms.
20. Multilinear polynomial systems: Root isolation and bit complexity.
21. Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems.
22. Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.
23. The complexity of subdivision for diameter-distance tests.
24. Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials.
25. Separation bounds for polynomial systems.
26. PTOPO: a maple package for the topology of parametric curves.
27. Sampling the feasible sets of SDPs and volume approximation.
28. Lower Bounds on the Number of Realizations of Rigid Graphs.
29. The Boolean complexity of computing Chow forms.
30. Randomized geometric tools for anomaly detection in stock markets.
31. Semidefinite games.
32. A Near-Optimal Expected Boolean Complexity Bound for Descartes Solver.
33. Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors.
34. Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case.
35. On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs.
36. Univariate real root isolation in an extension field and applications.
37. GPU-Based Homotopy Continuation for Minimal Problems in Computer Vision.
38. Segre-Driven Radicality Testing.
39. Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo.
40. PTOPO: Computing the Geometry and the Topology of Parametric Curves.
41. The Complexity of an Adaptive Subdivision Method for Approximating Real Curves.
42. Resultants and Discriminants for Bivariate Tensor-Product Polynomials.
43. Sparse Rational Univariate Representation.
44. Efficient Sampling from Feasible Sets of SDPs and Volume Approximation.
45. Geometric algorithms for sampling the flux space of metabolic networks.
46. Improving root separation bounds.
47. On the Bit Complexity of Solving Bilinear Polynomial Systems.
48. A Superfast Randomized Algorithm to Decompose Binary Forms.
49. Accelerated approximation of the complex roots and factors of a univariate polynomial.
50. Nearly optimal computations with structured matrices.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.