400 search results - page 24 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
110
click to vote
PVM
2005
Springer
15 years 5 months ago
2005
Springer
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
CVGIP
2010
14 years 12 months ago
2010
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
CP
2004
Springer
15 years 5 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
103
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ICML
2008
IEEE
16 years 19 days ago
2008
IEEE
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...