895 search results - page 33 / 179 » Approximate convex decomposition |
101
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
EUSFLAT
2009
14 years 7 months ago
2009
Abstract-- Recently, many scholars investigated interval, triangular, and trapezoidal approximations of fuzzy numbers. These researches can be grouped into two classes: the Euclide...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
ANOR
2006
14 years 9 months ago
2006
This paper derives a new splitting-based decomposition algorithm for convex stochastic programs. It combines certain attractive features of the progressive hedging algorithm of Roc...