1389 search results - page 119 / 278 » Improved Approximation Algorithms for Label Cover Problems |
146
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
118
click to vote
ICAI
2009
15 years 1 months ago
2009
- We address the issues of improving the feature generation methods for the value-function approximation and the state space approximation. We focus the improvement of feature gene...
118
click to vote
CONIELECOMP
2005
IEEE
15 years 9 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
151
click to vote
JCP
2007
15 years 3 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
117
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...