Structure donnée And NotSylvain Petitjean
List of bibliographic references
Number of relevant bibliographic references: 24.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000037 | Edouard Klein [France] ; Bilal Piot [France] ; Matthieu Geist [France] ; Olivier Pietquin [France] | Classification structurée pour l'apprentissage par renforcement inverse |
| 000130 | Nicolas Passat [France] ; Benoît Naegel [France] ; François Rousseau [France] ; Mériam Koob [France] ; Jean-Louis Dietemann [France] | Interactive segmentation based on component-trees |
| 000138 | Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie] | Automatic decidability and combinability |
| 000330 | Rahee Ghurbhurn [France] ; Philippe Beaune [France] ; Hugues Solignac [France] | Accès à des sources de données hétérogènes par des processus métiers intégrés |
| 000340 | Otfried Cheong [Corée du Sud] ; Hazel Everett [France] ; Hyo-Sil Kim [Corée du Sud] ; Sylvain Lazard [France] ; René Schott [France] | Throwing stones inside simple polygons |
| 000384 | Didier Galmiche [France] ; Dominique Larchey-Wendling [France] | Expressivity properties of boolean BI through relational models |
| 000395 | TING ZHANG [États-Unis] ; Henny B. Sipma [États-Unis] ; Zohar Manna [États-Unis] | Decision procedures for term algebras with integer constraints |
| 000445 | Abdessamad Imine [France] ; Pascal Molli [France] ; Gérald Oster [France] ; Michaël Rusinowitch [France] | Towards synchronizing linear collaborative objects with operational transformation |
| 000493 | M. Van Den Brand [Pays-Bas] ; P.-E. Moreau [France] ; J. Vinju [Pays-Bas] | Generator of efficient strongly typed abstract syntax trees in Java |
| 000513 | Silvio Ranise [États-Unis] ; Christophe Ringeissen [États-Unis] ; Calogero G. Zarba [États-Unis] | Combining data structures with nonstably infinite theories using many-sorted logic |
| 000516 | Didier Galmiche [France] ; Daniel Mery [France] | Characterizing provability in BI's pointer logic through resource graphs |
| 000600 | P. E. Moreau [France] ; O. Zendra | GC2: A generational conservative garbage collector for the ATerm library |
| 000775 | Didier Galmiche [France] ; Daniel Mery [France] ; David Pym [Royaume-Uni] | Resource tableaux |
| 000818 | Didier Galmiche [France] ; Daniel Mery [France] | Connection-based proof search in propositional BI logic |
| 000881 | Horatiu Cirstea [France] | Specifying authentication protocols using rewriting and strategies |
| 000980 | G. Kucherov [France] ; M. Rusinowitch [France] | Patterns in words versus patterns in trees : A brief survey and new results |
| 000A57 | J.-F. Collard [France] | Analyse des définitions visibles : état de l'art et applications en parallélisation automatique |
| 000A60 | L. Bougrain [France] ; F. Alexandre | Unsupervised connectionist algorithms for clustering an environmental data set: a comparison |
| 000B27 | F. Bertault [France] ; G. Kucherov [France] | Visualization of dynamic automata using Padnon |
| 000B37 | E. A. Cichon [France] ; E. T. Bittar [France] | Ordinal recursive bounds for Higman's theorem |
| 000C34 | G. Louchard [Belgique] ; C. Kenyon [France] ; R. Schott [France] | Data structures' maxima |
| 000C84 | C. Lynch [France] ; P. Strogova [France] | PATCH graphs : An efficient data structure for complementation of finitely presented groups |
| 000D01 | C. Hintermeier [France] ; H. Kirchner [France] ; P. D. Mosses [Danemark] | Combining algebraic and set-theoretic specifications |
| 000D87 | J.-L. Remy | Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire |
| This area was generated with Dilib version V0.6.33. |  |