Sciweavers

214 search results - page 6 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
JMLR
2012
11 years 10 months ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
KDD
2010
ACM
217views Data Mining» more  KDD 2010»
13 years 6 months ago
Mining program workflow from interleaved traces
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software main...
Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, ...
ESANN
2007
13 years 9 months ago
Deploying SDP for machine learning
We discuss the use in machine learning of a general type of convex optimisation problem known as semi-definite programming (SDP) [1]. We intend to argue that SDP’s arise quite n...
Tijl De Bie
ICCAD
1995
IEEE
95views Hardware» more  ICCAD 1995»
13 years 11 months ago
A sequential quadratic programming approach to concurrent gate and wire sizing
With an ever-increasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnect-circuit design automation continues to grow in importance. By t...
Noel Menezes, Ross Baldick, Lawrence T. Pileggi