244 search results - page 31 / 49 » Intervalizing k-Colored Graphs |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
LCPC
2009
Springer
15 years 2 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
MICS
2010
14 years 8 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
101
Voted
MLDM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
69
Voted
ICTAI
2000
IEEE
15 years 1 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...