4781 search results - page 605 / 957 » Complexity at large |
173
click to vote
ICML
2009
IEEE
16 years 6 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 ...
141
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
132
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
165
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
142
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...