All Stories

  1. A Greedy Approach to the Canny-Emiris Formula
  2. Bounding the Number of Roots of Multi-Homogeneous Systems
  3. Similarity measures between polygonal lines
  4. Efficient algorithms and open software for estimating the volume of a convex polytope
  5. Fast similarity search for big data
  6. Matrix Representations by Means of Interpolation
  7. On the Bit Complexity of Solving Bilinear Polynomial Systems
  8. Compact Formulae in Sparse Elimination
  9. Minkowski Decomposition and Geometric Predicates in Sparse Implicitization
  10. Efficient Random-Walk Methods for Approximating Polytope Volume