Sciweavers

12148 search results - page 80 / 2430
» Generalized Bundle Methods
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
AMC
2005
168views more  AMC 2005»
13 years 7 months ago
Comparison between the homotopy analysis method and homotopy perturbation method
In this paper, we show that the so-called ``homotopy perturbation method'' is only a special case of the homotopy analysis method. Both methods are in principle based on...
Shijun Liao
BMCBI
2010
115views more  BMCBI 2010»
13 years 8 months ago
Multiconstrained gene clustering based on generalized projections
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
Jia Zeng, Shanfeng Zhu, Alan Wee-Chung Liew, Hong ...
BMCBI
2006
160views more  BMCBI 2006»
13 years 7 months ago
Gene prediction in eukaryotes with a generalized hidden Markov model that uses hints from external sources
Background: In order to improve gene prediction, extrinsic evidence on the gene structure can be collected from various sources of information such as genome-genome comparisons an...
Mario Stanke, Oliver Schöffmann, Burkhard Mor...
TNN
2010
143views Management» more  TNN 2010»
13 years 2 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...