565 search results - page 36 / 113 » Geometry of Upper Probabilities |
COMBINATORICS
2006
13 years 7 months ago
2006
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
JCS
2008
13 years 7 months ago
2008
Randomized protocols for hiding private information can be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be reg...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
ESA
2004
Springer
14 years 29 days ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...