2312 search results - page 201 / 463 » The complexity of estimating min-entropy |
186
click to vote
WSC
2008
15 years 9 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
141
click to vote
NIPS
2007
15 years 8 months ago
2007
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
159
click to vote
WCET
2008
15 years 8 months ago
2008
Static WCET analysis obtains a safe estimation of the WCET of a program. The timing behaviour of a program depends in many cases on input, and an analysis could take advantage of ...
136
click to vote
ESANN
2000
15 years 8 months ago
2000
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
154
click to vote
DBSEC
2008
15 years 7 months ago
2008
Abstract. When generalization algorithms are known to the public, an adversary can obtain a more precise estimation of the secret table than what can be deduced from the disclosed ...