874 search results - page 100 / 175 » Graph Transformation in a Nutshell |
108
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
MCS
2010
Springer
15 years 1 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
SIAMDM
2008
14 years 11 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
FPGA
2010
ACM
15 years 8 months ago
2010
ACM
d hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level progra...
WSC
2008
15 years 1 months ago
2008
Currently, system engineering problems are solved using a wide range of domain-specific models and corresponding languages. It is unlikely that a single unified modeling language ...