3395 search results - page 120 / 679 » Learning to efficiently rank |
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
WWW
2004
ACM
16 years 17 days ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
CPM
2007
Springer
15 years 3 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
AI
2004
Springer
14 years 11 months ago
2004
Springer
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...