1433 search results - page 102 / 287 » On Covering Problems of Rado |
182
click to vote
FOCM
2010
15 years 4 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...
206
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...
175
click to vote
NDSS
2009
IEEE
16 years 1 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...
152
click to vote
EUC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Radio Frequency Identification (RFID) finds use in numerous applications involving item identification and tracking. In a typical application, RFID tags are attached t...
200
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...