Buscar
Mostrando ítems 11-20 de 1376
Finding H-partitions efficiently
(E D P SciencesLes Ulis Cedex AFrança, 2005)
Algebraic theory for the clique operator
(Sociedade Brasileira de Computação, 2001)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Instituto Politécnico Nacional, 2017)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Computación y Sistemas, 2017)
ATTRACTORS POINTS IN THE AUTOSUBSTITUTION
(Universidad Católica del Norte, Departamento de Matemáticas, 2001)
De bruijn graph arcs
(2016)
Restringindo o espaço de busca na geração de estruturas de coalizão utilizando grafos
(Universidade Tecnológica Federal do ParanáCuritibaPrograma de Pós-Graduação em Computação Aplicada, 2015-08-20)
The coalition structures generating problem (CSG) involves partitioning the set of agents in all possible subsets (or coalitions). What makes this problem challenging is the number of possible coalitions that grows ...
Regular graph construction for semi-supervised learning
(IOP PublishingBristol, 2014)
Semi-supervised learning (SSL) stands out for using a small amount of labeled points for data clustering and classification. In this scenario graph-based methods allow the analysis of local and global characteristics of ...