4255 search results - page 556 / 851 » On Learning Boolean Functions |
145
Voted
NIPS
2000
15 years 3 months ago
2000
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
127
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: There has been an explosion in the number of single nucleotide polymorphisms (SNPs) within public databases. In this study we focused on non-synonymous protein coding ...
146
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
138
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
94
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...