560 search results - page 28 / 112 » Level-set methods for convex optimization |
117
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
101
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
146
click to vote
TKDE
2012
13 years 4 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
117
click to vote
TCAD
1998
15 years 1 months ago
1998
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
AMC
2007
15 years 1 months ago
2007
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...