10054 search results - page 469 / 2011 » On the Complexity of Function Learning |
152
click to vote
NIPS
2008
15 years 6 months ago
2008
In this paper we aim to train deep neural networks for rapid visual recognition. The task is highly challenging, largely due to the lack of a meaningful regularizer on the functio...
167
Voted
NIPS
2004
15 years 6 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
172
click to vote
ICML
1999
IEEE
16 years 5 months ago
1999
IEEE
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
139
Voted
EUROSYS
2007
ACM
16 years 2 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
173
Voted
COCO
1994
Springer
15 years 9 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...