Ara
Toplam kayıt 33, listelenen: 21-30
Colored simultaneous geometric embeddings
(Springer-Verlag Berlin, 2007)
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored ...
Comment on "Modified Baptista type chaotic cryptosystem via matrix secret key" [Phys. Lett. A 372 (2008) 5427]
(Elsevier Science BV, 2009-09-07)
In this comment, we analyze a recently proposed Baptista-like cryptosystem and show that it is not invertible. Others weaknesses are also reported. A modified version of this cryptosystem is proposed to show how to overcome ...
ICamp - The educational web for higher education
(Springer Verlag, 2006)
iCamp is an EC-funded research project in the area of Technology Enhanced Learning (TEL) that aims to support collaboration and social networking across systems, countries and disciplines in higher education. The concept ...
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 ...
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2008-11-17)
Recently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the ...
Cryptanalysis of a chaos-based image encryption algorithm
(Elsevier Science BV, 2009-03-30)
A chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and ...
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)
[No abstract available]
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 ...
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 ...
Crossing minimization in weighted bipartite graphs
(Springer, 2007)
Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ...