Ara
Toplam kayıt 12, 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 ...
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 ...
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 ...
The modified proactive feedback based flow control scheme for best-effort applications
(International Institute of Informatics and Systemics (IIIS), 2007)
High speed networks that are characterized by large bandwidth propagation delay products are expected to support applications with diverse traffic characteristics and Quality of Service (QoS) requirements. Thus, flow control ...
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 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 ...
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, ...
Error propagation through generalized high dimensional model representation for data partitioning
(Wiley-V C H Verlag GMBH, 2004)
In many circumstances the explicit form of a multivariate function is not known; rather a finite number of data is listed from some physical experiments. In such cases a function can be constructed only by imposing some ...
Force-directed approaches to sensor localization
(SIAM, 2006)
We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information ...