565 search results - page 27 / 113 » Geometry of Upper Probabilities |
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
JMLR
2012
11 years 10 months ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—In this paper, a novel error probability analysis of orthogonal space-time block coding (OSTBC) over independent but not necessarily identical Hoyt (Nakagami-q) fading channels ...
PVLDB
2010
13 years 6 months ago
2010
Enterprises often need to assess and manage the risk arising from uncertainty in their data. Such uncertainty is typically modeled as a probability distribution over the uncertain...
ICALP
2003
Springer
14 years 23 days ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...