We consider a mobile user accessing contents in a dynamic environment, where new
contents are generated over time (by the user's contacts) and remain relevant to the user for …

The principal goal of data compression (also known as source coding) is to replace data by
a compact representation in such a manner that from this representation the original data …

The theory of constrained quantization has been recently introduced by Pandey and
Roychowdhury. In this paper, they have further generalized their previous definition of …

In this paper, for a Borel probability measure $ P $ on a normed space $\mathbb R^ k $, we
extend the definitions of $ n $ th unconstrained quantization error, unconstrained …

Communication of quantized information is frequently followed by a computation. We
consider situations of distributed functional scalar quantization: distributed scalar …

This paper considers a sequential sensor scheduling and remote estimation problem with
one sensor and one estimator. The sensor makes sequential observations about the state of …

The basic goal of quantization for probability distribution is to reduce the number of values,
which is typically uncountable, describing a probability distribution to some finite set and …

Quantization of a probability distribution is the process of estimating a given probability by a
discrete probability that assumes only a finite number of levels in its support. Centroidal …

The quantization scheme in probability theory deals with finding a best approximation of a
given probability distribution by a probability distribution that is supported on finitely many …

In this paper, we have considered a uniform distribution on a regular hexagon and the set of
all its six vertices as a conditional set. For the uniform distribution under the conditional set …