The search session has expired. Please query the service again.

Displaying 661 – 680 of 1507

Showing per page

Joint queue-perturbed and weakly coupled power control for wireless backbone networks

Thomas Otieno Olwal, Karim Djouani, Okuthe P. Kogeda, Barend Jacobus van Wyk (2012)

International Journal of Applied Mathematics and Computer Science

Wireless Backbone Networks (WBNs) equipped with Multi-Radio Multi-Channel (MRMC) configurations do experience power control problems such as the inter-channel and co-channel interference, high energy consumption at multiple queues and unscalable network connectivity. Such network problems can be conveniently modelled using the theory of queue perturbation in the multiple queue systems and also as a weak coupling in a multiple channel wireless network. Consequently, this paper proposes a queue perturbation...

Joint Range of Rényi entropies

Peter Harremoës (2009)

Kybernetika

The exact range of the joined values of several Rényi entropies is determined. The method is based on topology with special emphasis on the orientation of the objects studied. Like in the case when only two orders of the Rényi entropies are studied, one can parametrize the boundary of the range. An explicit formula for a tight upper or lower bound for one order of entropy in terms of another order of entropy cannot be given.

K3M: a universal algorithm for image skeletonization and a review of thinning techniques

Khalid Saeed, Marek Tabędzki, Mariusz Rybnik, Marcin Adamski (2010)

International Journal of Applied Mathematics and Computer Science

This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential algorithms...

La medida de divergencia de Kagan en el muestreo secuencial con procesos de Dirichlet.

Domingo Morales González (1986)

Trabajos de Estadística

In this paper the Kagan divergence measure is extended in order to establish a measure of the information that a random sample gives about a Dirichlet process as a whole. After studying some of its properties, the expression obtained in sampling from the step n to the step n+1 is given, and its Bayesian properties are studied. We finish proving the good behaviour of a stopping rule defined on the basis of the information obtained in sampling when passing from a step to the following.

Lattice-Like Total Perfect Codes

Carlos Araujo, Italo Dejter (2014)

Discussiones Mathematicae Graph Theory

A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are parallel paths of length > 1 is posed as well.

Currently displaying 661 – 680 of 1507