14548 search results - page 2584 / 2910 » The Optimal Path-Matching Problem |
202
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
168
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
188
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text c...
141
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In many real-world applications, such as image retrieval, it would be natural to measure the distances from one instance to others using instance specific distance which captures ...
175
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...