895 search results - page 165 / 179 » Approximate convex decomposition |
118
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the field of detection and monitoring of dynamic objects in quasi-static scenes, background subtraction techniques where background is modeled at pixel-level, although showing ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
AAAI
2012
13 years 3 hour ago
2012
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
KSEM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
61
Voted
MLG
2007
Springer
15 years 3 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...