IDA
2010
Springer
13 years 10 months ago
2010
Springer
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
WSC
2008
14 years 1 months 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...
ISPD
1998
ACM
14 years 3 months ago
1998
ACM
It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those...
CRV
2006
IEEE
14 years 5 months ago
2006
IEEE
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...