4009 search results - page 719 / 802 » Clustering on Complex Graphs |
147
click to vote
ECAI
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
151
click to vote
ICS
1993
Tsinghua U.
15 years 8 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
154
click to vote
IPMU
1992
Springer
15 years 8 months ago
1992
Springer
This paper deals with the problem of inference under uncertain information. This is a generalization of a paper of Cardona et al. (1991a) where rules were not allowed to contain n...
119
click to vote
CIDM
2007
IEEE
15 years 8 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
143
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...