10054 search results - page 291 / 2011 » On the Complexity of Function Learning |
91
Voted
COLING
1990
15 years 4 months ago
1990
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
111
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
119
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
123
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
119
Voted
NIPS
2007
15 years 5 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...