4372 search results - page 789 / 875 » Algorithmic Theories of Everything |
169
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
144
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
We investigate the problem of learning document classifiers in a multilingual setting, from collections where labels are only partially available. We address this problem in the ...
181
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
212
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
179
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...