993 search results - page 17 / 199 » The Complexity of Probabilistic EL |
126
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
139
Voted
JMLR
2010
14 years 10 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
142
Voted
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
116
Voted
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
122
Voted
NAACL
2010
15 years 1 months ago
2010
In this work, we try a hybrid methodology for language modeling where both morphological decomposition and factored language modeling (FLM) are exploited to deal with the complex ...