Olivier Raynaud

Orcid: 0000-0002-9768-5477

According to our database1, Olivier Raynaud authored at least 27 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A closed sets based learning classifier for implicit authentication in web browsing.
Discret. Appl. Math., 2020

Accountability in the A Posteriori Access Control: A Requirement and a Mechanism.
Proceedings of the Quality of Information and Communications Technology, 2020

A Posteriori Analysis of Policy Temporal Compliance.
Proceedings of the Risks and Security of Internet and Systems, 2020

2019
Semantic Mediation for A Posteriori Log Analysis.
Proceedings of the 14th International Conference on Availability, Reliability and Security, 2019

2018
Encoding partial orders through modular decomposition.
J. Comput. Sci., 2018

Algorithms for a Bit-Vector Encoding of Trees.
ICO, 2018

2016
A Tool for Classification of Sequential Data.
Proceedings of the 5th International Workshop "What can FCA do for Artificial Intelligence"? co-located with the European Conference on Artificial Intelligence, 2016

2015
Am I Really Who I Claim to Be?
Proceedings of the New Contributions in Information Systems and Technologies, 2015

2014
Recursive decomposition tree of a Moore co-family and closure algorithm.
Ann. Math. Artif. Intell., 2014

Suis-je celui que je prétends être ?
Proceedings of the IC 2014 : 25es Journées francophones d'Ingénierie des Connaissances (Proceedings of the 25th French Knowledge Engineering Conference), 2014

Using Closed Itemsets for Implicit User Authentication in Web Browsing.
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

2013
Recursive decomposition and bounds of the lattice of Moore co-families.
Ann. Math. Artif. Intell., 2013

2012
Practical Use of Formal Concept Analysis in Service-Oriented Computing.
Proceedings of the Formal Concept Analysis - 10th International Conference, 2012

2011
A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families.
Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

Building FCA-Based Decision Trees for the Selection of Heterogeneous Services.
Proceedings of the IEEE International Conference on Services Computing, 2011

2010
The Complexity of Embedding Orders into Small Products of Chains.
Order, 2010

Counting of Moore Families for n=7.
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

2008
Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies.
Proceedings of the Modelling, 2008

2006
Twin Vertices in Hypergraphs.
Electron. Notes Discret. Math., 2006

Interactive Association Rules Discovery.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
Efficient algorithms for clone items detection.
Proceedings of the CLA 2005 International Workshop on Concept Lattices and their Applications Olomouc, 2005

2004
Computational aspects of the 2-dimension of partially ordered sets.
Theor. Comput. Sci., 2004

2002
A fast incremental algorithm for building lattices.
J. Exp. Theor. Artif. Intell., 2002

2001
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests.
Proceedings of the ECOOP 2001, 2001

2000
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.
Proceedings of the STACS 2000, 2000

1999
A Fast Algorithm for Building Lattices.
Inf. Process. Lett., 1999

Encoding of Multiple Inheritance Hierarchies and Partial Orders.
Comput. Intell., 1999


  Loading...