Mentions légales du service

Skip to content
Snippets Groups Projects
Select Git revision
  • expire_in protected
  • fast-deformable-butterfly protected
  • hakim_branch protected
  • main default protected
  • fast-deformable-butterfly-review_2024-07-02 protected
  • fix_scipy_deprecated_H protected
  • csr_matrix_H
  • 3.41.0 protected
  • 3.41.0a2 protected
  • 3.41.0a1 protected
  • 3.41.0a0 protected
  • 3.40.2 protected
  • 3.40.1 protected
  • 3.40.0 protected
  • 3.39.25 protected
  • 3.39.24 protected
  • 3.39.23 protected
  • 3.39.22 protected
  • 3.39.21 protected
  • 3.39.20 protected
  • 3.39.19 protected
  • 3.39.18 protected
  • 3.39.17 protected
  • 3.39.16 protected
  • 3.39.15 protected
  • 3.39.14 protected
  • 3.39.13 protected
27 results
Compare
hhakim's avatar
Update FGFT pyfaust benchmark to compute errors on 'optimal' signed permutation of Uhat.
hhakim authored 
The test of Thomas Frerix algorithm is commented out but kept here in case it would be needed later (on my own tests it is not more accurate and is for sure slower).
The idea of using the optimal permutation comes from his article.
43572089
History
hhakim's avatar 43572089
History
Name Last commit Last update