Using Statistical Techniques to Predict GA Performance
Published in Computational Geometry and Graphs
Published in Computational Geometry and Graphs
Published in Computational Geometry and Graphs
Published in Computational Geometry and Graphs
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient. This theory not only unifies the usual modular decomposition generalisations such as modular dec...
International audience
International audience
Computer-Supported Collaborative Learning (CSCL) technologies play an increasing role simultaneously with the appearance of the Social Web. The polyphonic analysis method based on Bakhtin’s dialogical model reflects the multi-voiced nature of a CSCL conversation and the related learning processes. We propose the extension of the model and the previ...
Published in Computational Geometry and Graphs
Published in Computational Geometry and Graphs
The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, ℓ. We prove an upper bound of O (n√(ℓ)) for all values of ℓ. This is an improvement over previous algorithms for all values of ℓ. On the other hand, we show that for any
Published in Computational Geometry and Graphs
Published in Computational Geometry and Graphs