Ara
Toplam kayıt 107, listelenen: 1-10
A priority based packet scheduler with deadline considerations
(IEEE Computer Soc, 2006)
QoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and ...
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 ...
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. ...
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 ...
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 ...
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 ...