565 search results - page 5 / 113 » Geometry of Upper Probabilities |
111
Voted
TIT
2011
14 years 10 months ago
2011
—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...
123
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
125
Voted
AMAI
2010
Springer
15 years 29 days ago
2010
Springer
The study of the interplay between belief and probability can be posed in a geometric framework, in which belief and plausibility functions are represented as points of simplices i...
132
Voted
ISIPTA
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
128
Voted
COMPGEOM
1994
ACM
15 years 7 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...