30 search results - page 2 / 6 » On a Global Complexity Bound of the Levenberg-Marquardt Meth... |
CGI
1998
IEEE
13 years 10 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
CG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
DMIN
2007
13 years 7 months ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
JMLR
2010
13 years 1 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
ICRA
2007
IEEE
14 years 18 days ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...