15 search results - page 2 / 3 » New cached-sufficient statistics algorithms for quickly answ... |
JMLR
2006
13 years 5 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
SIGOPS
2010
13 years 3 months ago
2010
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
TIT
2002
13 years 4 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
EC
2008
13 years 5 months ago
2008
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...