{"id":60,"date":"2015-04-11T02:52:21","date_gmt":"2015-04-11T02:52:21","guid":{"rendered":"https:\/\/adrien-v.pul-lup.fr\/wpav\/?page_id=60"},"modified":"2020-06-29T11:43:39","modified_gmt":"2020-06-29T11:43:39","slug":"publications-et-presentations","status":"publish","type":"page","link":"https:\/\/adrien-v.com\/?page_id=60&lang=fr","title":{"rendered":"Publications et Pr\u00e9sentations"},"content":{"rendered":"

<\/p>\n

Adrien Vieilleribi\u00e8re sur dblp<\/a><\/p>\n

Journaux<\/h2>\n

Approximate consistency for transformations on words and trees<\/strong>, avec Michel de Rougemont, Theoretical Computer Science, 2016 [editeur<\/a>, bibtex<\/a>]<\/p>\n

The directed Switching Game on Lawrence Oriented Matroids<\/strong>, avec David Forge, European Journal of Combinatorics<\/em>, 2009. [article<\/a>, \u00e9diteur<\/a>, bibtex<\/a>]<\/p>\n

Approximate Schemas, Source-Consistency and Query Answering,<\/strong> avec Michel de Rougemont. Journal of Intelligent Information Systems<\/em>, 2008. [article<\/a>, \u00e9diteur<\/a>, bibtex<\/a>]<\/p>\n

 <\/p>\n

Conf\u00e9rences<\/h2>\n

Improving time travel experience by combining annotations<\/strong>, Web Audio Conferebce 2016, [article<\/a>, poster<\/a>, \u00e9diteur<\/a>, bibtex<\/a>]<\/p>\n

Approximate Structural Consistency<\/strong> avec Michel de Rougemont, SOFSEM 2010, p. 685-696. [article<\/a>, pr\u00e9sentation<\/a>, \u00e9diteur<\/a>, bibtex<\/a>]<\/p>\n

\u00c9quivalence Approch\u00e9e de Transducteurs,<\/strong> CMF (Complexit\u00e9 et Mod\u00e8les Finis)<\/em>, 2007.[pr\u00e9sentation<\/a>]<\/p>\n

Approximate Data Exchange<\/strong>, avec Michel de Rougemont, International Conference on Database Theory<\/em>, 2007. [article<\/a>, pr\u00e9sentation<\/a>, \u00e9diteur<\/a>, bibtex<\/a>]<\/p>\n

Approximate schemas and Query Answering<\/strong>, avec Michel de Rougemont, Information Search, Integration and Personalization<\/em>, 2005.<\/p>\n

Some Properties of Directed Switching Games on Oriented Matroids<\/strong>, avec David Forge, Combinatorial Geometries and Applications : Oriented Matroids and Matroids<\/em>, 2005. [pr\u00e9sentation<\/a>]<\/p>\n

 <\/p>\n

Projets de recherche<\/h2>\n

DoCoVi<\/strong> : Document Composition through Visual Interaction : r\u00e9ponse \u00e0 l\u2019appel d\u2019offre ANR CONTINT 2011.
\n<\/em><\/p>\n

CIPE<\/strong> : Composition, Indexation, et Personnalisation d\u2019Ebook : r\u00e9ponse \u00e0 l\u2019appel d\u2019offre Digiteo-Ile-de-France 2010.<\/em><\/p>\n

VERAP<\/strong> : V\u00e9Rification Approch\u00e9e de syst\u00e8mes Probabilistes : ACI “s\u00e9curit\u00e9 et informatique” <\/em>2006-2008<\/p>\n

VISIR<\/strong> : VISual InteRaction : Projet Digiteo <\/em>2008 [poster<\/a>]<\/p>\n

 <\/p>\n

Groupes de travail<\/h2>\n

From Approximate membership To Data Integration<\/strong>, MOVE 2010. [pr\u00e9sentation<\/a>]<\/p>\n

Approximate Tree Transducers<\/strong>, On Verification of Web Services (VerAp) 2008.<\/p>\n

 <\/p>\n

Rapports<\/h2>\n

Th\u00e8se de doctorat<\/strong> : Transformations de Mots, d\u2019Arbres et de Statistiques [Manuscript<\/a>,pr\u00e9sentation<\/a>]<\/p>\n

Jeux s\u00e9mantiques et v\u00e9rification<\/strong>, \u00e9cole d’informatique th\u00e9orique, 2006.<\/p>\n

Complexit\u00e9 Algorithmique<\/strong>, \u00e9cole d’informatique th\u00e9orique, 2005.<\/p>\n

Complexit\u00e9 et th\u00e9orie de jeux<\/strong>, Stage de recherche au Laboratoire de Recherche en Informatique dans l’\u00e9quipe Algorithmique et Complexit\u00e9, sous la direction de Michel de Rougemont, 2004. [Manuscript<\/a>]<\/p>\n

Algorithmique des matro\u00efdes<\/strong>, : Stage de recherche au L.R.I. dans l’\u00e9quipe Graphcom, supervis\u00e9 par David Forge, 2003.<\/p>\n

\u00c9tude du polyn\u00f4me chromatique<\/strong>, Stage de recherche dans l’\u00e9quipe Graphcom du L.R.I, sous la direction de Pascal Berthom\u00e9, 2002.<\/p>\n

D\u00e9nombrement<\/strong> de motifs et probabilit\u00e9s de r\u00e9p\u00e9tition : stage de magist\u00e8re de math\u00e9matiques, 2002.<\/p>\n

 <\/p>\n","protected":false},"excerpt":{"rendered":"

Adrien Vieilleribi\u00e8re sur dblp Journaux Approximate consistency for transformations on words and trees, avec Michel de Rougemont, Theoretical Computer Science, 2016 [editeur, bibtex] The directed Switching Game on Lawrence Oriented Matroids, avec David Forge, European Journal of Combinatorics, 2009. [article, \u00e9diteur, bibtex] Approximate Schemas, Source-Consistency and Query Answering, avec Michel de Rougemont. Journal of Intelligent<\/p>\n

Read More<\/a><\/div>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-60","page","type-page","status-publish"],"_links":{"self":[{"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/pages\/60"}],"collection":[{"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/adrien-v.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=60"}],"version-history":[{"count":17,"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/pages\/60\/revisions"}],"predecessor-version":[{"id":474,"href":"https:\/\/adrien-v.com\/index.php?rest_route=\/wp\/v2\/pages\/60\/revisions\/474"}],"wp:attachment":[{"href":"https:\/\/adrien-v.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=60"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}