Sciweavers

1092 search results - page 47 / 219
» Convex Methods for Transduction
Sort
View
MOR
2002
72views more  MOR 2002»
13 years 8 months ago
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
Jie Sun, Kim-Chuan Toh, Gongyun Zhao
ICPR
2008
IEEE
14 years 3 months ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji
ECCV
2010
Springer
14 years 2 months ago
Convex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
NIPS
2008
13 years 10 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ACMSE
2010
ACM
13 years 4 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins