Ara
Toplam kayıt 13, listelenen: 1-10
Cryptanalysis of image encryption with compound chaotic sequence
(IEEE, 2009)
Recently, an image encryption algorithm based on compound chaotic sequence was proposed [Tong et al., Image and Vision Computing 26 (2008) 843]. In this paper, we analyze the security weaknesses of the proposal. We give ...
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)
[No abstract available]
A robust localization framework to handle noisy measurements in wireless sensor networks
(IEEE, 2009-09-14)
We construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to ...
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 ...
Fully decentralized, collaborative multilateration primitives for uniquely localizing WSNs
(Springer-Verlag Berlin, 2009)
We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ...
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 ...
An incremental model selection algorithm based on cross-validation for finding the architecture of a Hidden Markov model on hand gesture data sets
(IEEE, 2009-12-13)
In a multi-parameter learning problem, besides choosing the architecture of the learner, there is the problem of finding the optimal parameters to get maximum performance. When the number of parameters to be tuned increases, ...
Integrating vendors into cooperative design practices
(Taylor & Francis Ltd, 2009)
This paper describes a new approach to cooperative design using distributed, off-the-shelf design components. The ultimate goal is to enable assemblers to rapidly design their products and perform simulations using parts ...
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12)
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ...
Algebraic break of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2009-03-30)
Recently, a cryptosystem based on two-dimensional discretized chaotic maps was proposed [T. Xiang, et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we cryptanalyze the proposal using algebraic methods. We give three ...