Loading...
Sous-collection du département 1: Algorithmique, calcul, image et géométrie
Pour toute question ou remarque au sujet de cette collection, veuillez nous contacter à publications@loria.fr
Derniers Dépôts
Nombre de documents fulltext
880
Répartition des dépôts par type de document
Mots Clés
Authenticated encryption
Shape modeling
Mesh untangling
Deconvolution
Rigid motion
Hyperelliptic curves
Delaney-Dress tiling theory
Kinematics
Clustering
Cryptographie
Discrete logarithm
Implicit surfaces
Piecewise affine systems
Isogénies
Vision par ordinateur
Biomechanical Modeling
Parallel robot
Abelian varieties
Geometry processing
Optimal pattern
Apprentissage profond
Voronoi diagrams
Segmentation
Cryptanalysis
Algorithm
Certified Numerical Algorithms
Object detection
3D printing
Computing methodologies
Displacement
Vanishing points
Meshing
Image registration
Dominant point
Discrete geometry
Deep learning
Augmented reality
Rademacher complexity
Grid method
Fabrication additive
Theta functions
Mitral valve
Image processing
Courbes hyperelliptiques
Inverted pendulum
Topology
Global optimization
Machine learning
Additive manufacturing
Windowed Fourier analysis
3D Printing
Delaunay triangulations
Finite Fields
Biomechanical simulation
Hyperbolic surface
Localized spectrum analysis
System identification
Voronoi diagram
Pose estimation
Géométrie discrète
Image analysis
Fabrication
Bivariate system
Number Field Sieve
Correct rounding
Delaunay triangulation
Computer vision
CNN
Classification
Augmented Reality
Logarithme discret
Réalité augmentée
Cylindrical algebraic decomposition
Digital image correlation
Finite field
Cryptography
Switched systems
Lightweight cryptography
Algorithms
Convex relaxation
Sparsity
Number field sieve
Function field sieve
Computational geometry
Digital geometry
Software
Probabilistic analysis
Numerical simulation
Floating-point arithmetic
Boomerang attack
Metrology
Additive Manufacturing
Courbes elliptiques
Learning theory
Regression
Checkerboard
Digital Image Correlation
Full-field measurement
Complexity
Finite fields