895 search results - page 92 / 179 » Approximate convex decomposition |
117
click to vote
WSC
2008
15 years 5 days ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
AAAI
1992
14 years 11 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
PAMI
2008
14 years 9 months ago
2008
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
110
click to vote
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...