Ara
Toplam kayıt 34, listelenen: 11-20
Incremental construction of classifier and discriminant ensembles
(Elsevier Science Inc, 2009-04-15)
We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier ...
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)
[No abstract available]
Driver recognition using gaussian mixture models and decision fusion techniques
(Springer-Verlag Berlin, 2008)
In this paper we present our research in driver recognition. The goal of this study is to investigate the performance of different classifier fusion techniques in a driver recognition scenario. We are using solely driving ...
A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid
(Elsevier Science inc, 2005-05-25)
When the values of a multivariate function f(x(1),...,x(N)), having N independent variables like x(1),...,x(N) are given at the nodes of a cartesian, product set in the space of the independent variables and ail interpolation ...
Hybrid high dimensional model representation (HHDMR) on the partitioned data
(Elsevier B.V., 2006-01-01)
A multivariate interpolation problem is generally constructed for appropriate determination of a multivariate function whose values are given at a finite number of nodes of a multivariate grid. One way to construct the ...
The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies
(Cambridge University Press, 2008-12-12)
In this paper we describe a conceptual framework and implementation of a tool that supports task-directed, distributed routine design (RD) augmented with simulation-based design testing. In our research, we leverage the ...
Comment on "Encryption and decryption of images with chaotic map lattices" [Chaos 16, 033118 (2006)]
(American Institute of Physics Inc., 2008-09)
In this paper, we comment on the chaotic encryption algorithm proposed by A. N. Pisarchik et al. [Chaos 16, 033118 (2006)]. We demonstrate that the algorithm is not invertible. We suggest simple modifications that can ...
QoS-constrained core selection for group communication
(IEEE, 2005)
The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in inter and intra-domain routing. In an earlier work [KH04], we showed that the constrained cost ...
Design of real-time VBR traffic shaping schemes by considering the impact of both buffer overflows and deadline violations
(Int Inst Informatics & Systemics, 2005)
While smoothing the traffic of time sensitive applications at the user premises can reduce the losses due to buffer overflows within the network, it may have an adverse effect on the losses due to the deadline violations ...
Calculating the VC-dimension of decision trees
(IEEE, 2009)
We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the ...