5802 search results - page 264 / 1161 » Parallelizing Feature Selection |
123
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
110
Voted
GIR
2008
ACM
15 years 4 months ago
2008
ACM
We conduct large-scale search engine relevance experiments, using the 12% of queries that contain placenames, matching the placenames to places in the documents, and examining the...
112
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
We present a novel method for feature matching across widely separated color images. The proposed approach is robust and can support various correspondence based algorithms e.g. t...
ISBI
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present and study two local features for the tracking of vascular structures on 3D angiograms. The first one, Flux, measures the inward gradient flux through c...
119
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...