1424 search results - page 94 / 285 » The Multi-radius Cover Problem |
124
click to vote
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...
140
click to vote
FOCM
2010
15 years 1 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
146
click to vote
EOR
2010
15 years 11 days ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
142
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
132
click to vote
NDSS
2009
IEEE
15 years 9 months ago
2009
IEEE
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...