Sciweavers

1092 search results - page 94 / 219
» Convex Methods for Transduction
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
CORR
2006
Springer
76views Education» more  CORR 2006»
14 years 10 months ago
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
Martin J. Wainwright
ICML
2009
IEEE
15 years 10 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
BMCBI
2007
126views more  BMCBI 2007»
14 years 10 months ago
High-throughput identification of interacting protein-protein binding sites
Background: With the advent of increasing sequence and structural data, a number of methods have been proposed to locate putative protein binding sites from protein surfaces. Ther...
Jo-Lan Chung, Wei Wang, Philip E. Bourne
ICIP
2008
IEEE
15 years 11 months ago
Automated line flattening of Atomic Force Microscopy images
In this paper, an automated algorithm to flatten lines from Atomic Force Microscopy (AFM) images is presented. Due to the mechanics of the AFM, there is a curvature distortion (bo...
Sotirios A. Tsaftaris, Jana Zujovic, Aggelos K. Ka...