560 search results - page 41 / 112 » Level-set methods for convex optimization |
147
Voted
WICOMM
2010
15 years 1 months ago
2010
The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an in...
149
Voted
IJON
2007
15 years 3 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
160
click to vote
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
146
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
221
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...