1092 search results - page 172 / 219 » Convex Methods for Transduction |
ICCAD
1999
IEEE
14 years 2 months ago
1999
IEEE
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
NIPS
2008
13 years 11 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
NIPS
2008
13 years 11 months ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
NIPS
2007
13 years 11 months ago
2007
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...