308 search results - page 5 / 62 » Efficient reduction of support vectors in kernel-based metho... |
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
Vector representation of binary images has an advantage of keeping high image quality for arbitrary scaling as well as editing capability of an object. However, the vector represe...
ACL
2011
12 years 11 months ago
2011
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
CIARP
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
IJNSEC
2008
13 years 7 months ago
2008
One of the biggest challenges facing digital investigators is the sheer volume of data that must be searched in locating the digital evidence. How to efficiently locate the eviden...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...