548 search results - page 93 / 110 » Optimization of Convex Risk Functions |
126
Voted
NIPS
2008
15 years 1 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...
MP
2008
14 years 11 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
CIMAGING
2009
14 years 9 months ago
2009
We present an extension of the development of an alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitude and phase...
MP
2010
14 years 6 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
109
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...