717 search results - page 86 / 144 » Efficient implementation of SVM for large class problems |
105
click to vote
AIPS
2009
15 years 1 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
JUCS
2002
14 years 11 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
104
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
109
click to vote
JCM
2007
14 years 11 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
MICCAI
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We present the fast Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large clas...