Sciweavers

3675 search results - page 317 / 735
» Support Vector Tracking
Sort
View
CIARP
2010
Springer
15 years 4 months ago
A New Algorithm for Training SVMs Using Approximate Minimal Enclosing Balls
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...
Emanuele Frandi, Maria Grazia Gasparo, Stefano Lod...
ENTCS
2010
118views more  ENTCS 2010»
15 years 4 months ago
Transaction Scripts: Making Implicit Scenarios Explicit
We describe a true-concurrent approach for managing dependencies between distributed and concurrent coordinator components of a long-running transaction. In previous work we have ...
Sotiris Moschoyiannis, Amir R. Razavi, Paul J. Kra...
JMLR
2011
110views more  JMLR 2011»
15 years 1 months ago
Training SVMs Without Offset
We develop, analyze, and test a training algorithm for support vector machine classifiers without offset. Key features of this algorithm are a new, statistically motivated stoppi...
Ingo Steinwart, Don R. Hush, Clint Scovel
PAKDD
2009
ACM
233views Data Mining» more  PAKDD 2009»
15 years 11 months ago
A Kernel Framework for Protein Residue Annotation
Abstract. Over the last decade several prediction methods have been developed for determining structural and functional properties of individual protein residues using sequence and...
Huzefa Rangwala, Christopher Kauffman, George Kary...
GPEM
2008
128views more  GPEM 2008»
15 years 6 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood