Sciweavers

1510 search results - page 5 / 302
» Upper Probabilities and Additivity
Sort
View
ISIPTA
2003
IEEE
15 years 9 months ago
Products of Capacities Derived from Additive Measures
abstract DAMJAN ˇSKULJ University of Ljubljana, Slovenia A new approach to define a product of capacities is presented. It works for capacities that are in a certain relation wi...
Damjan Skulj
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 2 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
TIT
2011
116views more  TIT 2011»
14 years 11 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
15 years 10 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman
VTC
2007
IEEE
15 years 10 months ago
An Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
–Call admission control (CAC) is essential to guarantee the signal quality in CDMA systems. Signal-tointerference-and-noise ratio (SINR) is used as a criterion for user admission...
Mahmoud El-Sayes, Mohamed H. Ahmed