41 search results - page 5 / 9 » mcs 2010 |
MCS
2010
Springer
13 years 4 months ago
2010
Springer
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...
MCS
2010
Springer
14 years 27 days ago
2010
Springer
Abstract. In this paper we present a novel approach to combining multiple kernels where the kernels are computed from different information channels. In contrast to traditional me...
MCS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
MCS
2010
Springer
13 years 4 months ago
2010
Springer
We show that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. However, the biased Metropolis method can also be applied when an ...
DSD
2010
IEEE
13 years 6 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...