2490 search results - page 149 / 498 » The Generalized Theory of Model Preference |
183
click to vote
ICLA
2011
Springer
14 years 8 months ago
2011
Springer
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
192
Voted
STOC
2000
ACM
15 years 9 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
140
click to vote
COGSCI
2010
15 years 4 months ago
2010
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
128
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
118
click to vote
SIGIR
2008
ACM
15 years 4 months ago
2008
ACM
We describe a method for applying parsimonious language models to re-estimate the term probabilities assigned by relevance models. We apply our method to six topic sets from test ...