2312 search results - page 319 / 463 » The complexity of estimating min-entropy |
191
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
180
click to vote
CAS
2008
15 years 7 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
183
click to vote
IJAC
2008
15 years 6 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
167
click to vote
CSDA
2007
15 years 6 months ago
2007
The problem of detecting changes in wind speed and direction is considered. Bayesian priors, with various degrees of certainty, are used to represent relationships between the two...
184
click to vote
JMLR
2008
15 years 6 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...