Skip to Main content Skip to Navigation

Department 1: Algorithms, Computation, Image & Geometry

 For all your questions or comments about this collection, please contact us at: publications@loria.fr

 

Latest deposits

Chargement de la page

 

 

 

Number of full text documents

675

Submissions distribution by document type

Keywords

Fonctions thêta Algorithms Certified Numerical Algorithms Convex optimization Switched regression Displacement Optimization Discrete logarithm Generic Singularities Logarithme discret Algorithm Meshing Localized spectrum analysis Global optimization Full-field measurement Sparsity Differentiator Faithful rounding Digital image correlation Finite fields Fabrication System identification Biomechanical Modeling Kinematics Clustering Computer Assisted Surgery Couplage Shape modeling Voronoi diagrams Geometry processing Computer algebra Image registration Heteroscedastic noise Cryptanalysis Computational geometry Delaunay triangulations Learning theory Segmentation 3D Printing Parallel robot Medical imaging Deconvolution Cryptography Computer vision Number Field Sieve Number field sieve Metrological performance Complexity Crible algébrique Finite field Discrete structure Additive manufacturing Discrete logarithm problem Metrology Convex relaxation Singularities Function field sieve Regression Hybrid systems Software Impression 3D Cryptographie Apprentissage profond Checkerboard Courbes hyperelliptiques Dominant point Topology Augmented reality Experimental mechanics GPU Deep learning Factorization Additive Manufacturing Machine learning Cylindrical algebraic decomposition Hyperelliptic curves Theta functions Discrete geometry 3D printing Delaunay triangulation Bivariate system Delaney-Dress tiling theory Courbes elliptiques Corps finis Abelian varieties Géométrie discrète Piecewise affine systems Vision par ordinateur Margin classifiers Probabilistic analysis Grid method Design Isogénies Inverted pendulum Discrete hyperplane Classification Windowed Fourier analysis Digital geometry Dominant points Rademacher complexity