995 search results - page 165 / 199 » Learning Useful Horn Approximations |
124
click to vote
DSMML
2004
Springer
15 years 6 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
107
Voted
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
105
Voted
ICML
1994
IEEE
15 years 4 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
AAAI
2007
15 years 3 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
97
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...