565 search results - page 14 / 113 » Geometry of Upper Probabilities |
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
SPAA
1992
ACM
13 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challe...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
SGP
2003
13 years 8 months ago
2003
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...