Sciweavers

226 search results - page 37 / 46
» A power penalty method for linear complementarity problems
Sort
View
RECOMB
2005
Springer
15 years 10 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
CVPR
2005
IEEE
15 years 11 months ago
Matching with PROSAC - Progressive Sample Consensus
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
Ondrej Chum, Jiri Matas
CVPR
2007
IEEE
15 years 11 months ago
Multi-label image segmentation via max-sum solver
We formulate single-image multi-label segmentation into regions coherent in texture and color as a MAX-SUM problem for which efficient linear programming based solvers have recent...
Branislav Micusík, Tomás Pajdla
ICML
2004
IEEE
15 years 10 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
BIBM
2008
IEEE
137views Bioinformatics» more  BIBM 2008»
15 years 4 months ago
Exploring Alternative Splicing Features Using Support Vector Machines
Alternative splicing is a mechanism for generating different gene transcripts (called isoforms) from the same genomic sequence. Finding alternative splicing events experimentally ...
Jing Xia, Doina Caragea, Susan Brown