-
Modeling of polycrystals using a gradient crystal plasticity theory that incl...
International audience -
On Computing Pareto Stable Assignments
International audience -
An algorithm proposal for a minimum cost SDR multi-standard system using grap...
International audience -
A Grammar Correction Algorithm
éditeurs : de Groote, Philippe; Egg, Markus; Kallmeyer, Laura -
Computationally efficient, one-pass algorithm for morphological filters
International audience -
Hyperelliptic curves and their invariants: geometric, arithmetic and algorith...
Related numeric data and programs are available on the web pages of the authors -
Fast computation of isomorphisms of hyperelliptic curves and explicit descent
International audience -
Analyse de réseaux sociaux et recommandation de contenus non populaires
National audience -
An explicit expression of the L\"uroth invariant
International audience -
Memory Accesses management during High Level Synthesis
ISBN : 1-58113-937-3 -
Teaching algorithm, what for? Some new questions for mathematics and issues f...
Recently, the notion of algorithm has gained in importance in secondary school curricula, in France and abroad. Algorithm is strongly linked with computer science,... -
Low-cost countermeasures against physical attacks on cryptographic algorithms...
Side-Channel Analysis (SCA) and Fault Attacks (FA) are techniques to recover sensitive information in cryptographic systems by exploiting unintentional physical... -
Preuves et jeux sémantiques
National audience -
Sustainability in static-priority restricted-migration scheduling
International audience -
A quasi-linear algorithm to compute the tree of shapes of n-D images
International audience -
The J-UNIO protocol for automated protein structure determination by NMR in s...
International audience -
Exact and approximate algorithms for computing the hyperbolicity of large-sca...
Let G be a connected graph, and let d(a, b) denotes the shortest path distance between vertices a and b of G. The graph G is δ-hyperbolic if for any vertices a, b, c,... -
The irregular chromatic index of trees
A graph G is locally irregular if adjacent vertices of G have distinct degrees. An edge colouring of G is locally irregular if each of its colours induces a locally...
