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
893
Répartition des dépôts par type de document
Mots Clés
Metrology
Abelian varieties
Algorithms
Shape modeling
Rademacher complexity
Courbes hyperelliptiques
Vanishing points
3D Printing
3D printing
Réalité augmentée
Boomerang attack
Image analysis
Floating-point arithmetic
Checkerboard
Learning theory
Biomechanical simulation
Fabrication additive
Additive manufacturing
Cryptography
Parallel robot
Topology
Object detection
Mesh untangling
Geometry processing
Convex relaxation
Neural networks
Grid method
Deep learning
Image processing
Courbes elliptiques
Segmentation
Image registration
Piecewise affine systems
Windowed Fourier analysis
Biomechanical Modeling
Probabilistic analysis
Correct rounding
Function field sieve
Discrete geometry
System identification
Pose estimation
Authenticated encryption
Algorithm
Fabrication
Displacement
Number Field Sieve
Cylindrical algebraic decomposition
Isogénies
Clustering
Numerical simulation
Computational geometry
Number field sieve
Digital geometry
Cryptographie
Logarithme discret
Additive Manufacturing
Augmented Reality
Vision par ordinateur
Delaunay triangulations
Regression
Hyperbolic surface
Global optimization
Meshing
Finite fields
Digital Image Correlation
Sparsity
Localized spectrum analysis
Switched systems
Kinematics
Discrete logarithm
Deconvolution
Delaney-Dress tiling theory
Lightweight cryptography
Voronoi diagram
Full-field measurement
Rigid motion
Classification
Inverted pendulum
Computing methodologies
Finite Fields
Hyperelliptic curves
Apprentissage profond
Digital image correlation
Software
Optimal pattern
Theta functions
Implicit surfaces
Computer graphics
Computer vision
Augmented reality
Bivariate system
Voronoi diagrams
Machine learning
Delaunay triangulation
Finite field
Géométrie discrète
Mitral valve
Cryptanalysis
Dominant point
Complexity