1510 search results - page 100 / 302 » Upper Probabilities and Additivity |
IJAR
2010
14 years 7 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
ECCC
2011
14 years 4 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
—Multi-input multi-output (MIMO) receivers have generally been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless tra...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
BROADNETS
2005
IEEE
15 years 3 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...