Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Christian Capelle"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here
Externí odkaz:
https://doaj.org/article/2e9efd46ec764df798146183d1950a56
Autor:
Mitzi Catalan-Ahumada, Christian Capelle, Patricia Arno, Claude Veraart, Marie-Chantal Wanet-Defalque
Publikováno v:
Perception. 28:1013-1029
Recognition tasks of simple visual patterns have been used to assess an early visual – auditory sensory-substitution system, consisting of the coupling of a rough model of the human retina with an inverse model of the cochlea, by means of a pixel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5123537ca0754e9dae409795efc72df3
https://doi.org/10.1068/p2607
https://doi.org/10.1068/p2607
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 5, Iss 1 (2002)
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.55-70
HAL
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.55-70
HAL
A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6bdc441bc22ba1fa9a11f955eee030e
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/161
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/161
Autor:
Christian Capelle
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783540637578
WG
WG
Inheritance hierarchies play a central role in object oriented languages as in knowledge representation systems. These hierarchies are acyclic directed graphs representing the underline structure of objects. This paper is devoted to the study of effi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::492e7744ce78fa688047b9f4bab05fcf
https://doi.org/10.1007/bfb0024493
https://doi.org/10.1007/bfb0024493
Autor:
Christian Capelle
Publikováno v:
Orders, Algorithms, and Applications ISBN: 9783540582748
ORDAL
ORDAL
We present an practical method to obtain a compact computer memory representation of orders and to compute pairwise comparisons efficiently. The principle of this method is to represent an order P as a union of interval orders P i for which an optima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df461593ca50c31770976fe53264c036
https://doi.org/10.1007/bfb0019432
https://doi.org/10.1007/bfb0019432
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.