type:REPORT - Groups

Complexity analysis of random geometric structures made simpler

Average-case analysis of data-structures or algorithms is commonly used in compu- tational geometry when the, more classical, worst-case analysis is deemed overly...

HTML

Hyperbolic Delaunay complexes and Voronoi diagrams made practical

We study Delaunay complexes and Voronoi diagrams in the Poincaré ball, a confomal model of the hyperbolic space, in any dimension. We elaborate on our earlier work on...

HTML

Analysis of Dehn algorithm by critical pairs

This dataset has no description

HTML

La microprogrammation du systeme LELISP: une premiere approche

Résumé disponible sur le PDF

HTML

Analyse discriminante:Methode du type plus proches voisins utilisant un pretr...

This dataset has no description

HTML

Evaluation d'un dispositif d'assistance a l'operateur dans le secteur industr...

This dataset has no description

HTML

The part and try algorithm adapted to free channel access

This dataset has no description

HTML

Homological reconstruction and simplification in R3

We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H∗(X) of some complex X with L ⊂...