569 search results - page 3 / 114 » Online Bounds for Bayesian Algorithms |
STOC
1991
ACM
13 years 8 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—In this paper, we consider the Bayesian CramerRao bound (BCRB) for the dynamical estimation of multi-path Rayleigh channel complex gains in data-aided (DA) and non-dataa...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
NIPS
1998
13 years 6 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...