131 search results - page 4 / 27 » Approximate dynamic programming using support vector regress... |
140
click to vote
CPM
1998
Springer
15 years 3 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
89
Voted
ESANN
2008
15 years 1 months ago
2008
While it is well-known that model can enhance the control performance in terms of precision or energy efficiency, the practical application has often been limited by the complexiti...
CSMR
2007
IEEE
15 years 6 months ago
2007
IEEE
Many of the existing techniques for impact set computation in change propagation and regression testing are approximate for the sake of efficiency. A way to improve precision is ...
107
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
CGF
2005
14 years 11 months ago
2005
We propose statistical learning methods for approximating implicit surfaces and computing dense 3D deformation fields. Our approach is based on Support Vector (SV) Machines, which...