3395 search results - page 212 / 679 » Learning to efficiently rank |
149
click to vote
JMLR
2006
15 years 3 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...
150
click to vote
EUROCRYPT
2010
Springer
15 years 7 months ago
2010
Springer
We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in...
100
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given the return series for a set of instruments, a trading strategy is a switching function that transfers wealth from one instrument to another at specified times. We present ef...
144
Voted
JMLR
2010
14 years 10 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
153
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...