1376 search results - page 102 / 276 » The Localization Hypothesis and Machines |
151
Voted
ML
2002
ACM
15 years 11 days ago
2002
ACM
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
126
Voted
ICMLA
2010
14 years 10 months ago
2010
Abstract--Learning multiple related tasks from data simultaneously can improve predictive performance relative to learning these tasks independently. In this paper we propose a nov...
140
click to vote
ALT
2011
Springer
14 years 21 days ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
102
click to vote
EUROPAR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Modern multiprocessor architectures such as CC-NUMA machines or CMPs have nonuniform communication architectures that render programs sensitive to memory access locality....
113
click to vote
LCPC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Partitioned Global Address Space (PGAS) languages offer an attractive, high-productivity programming model for programming large-scale parallel machines. PGAS languages, ...