5624 search results - page 75 / 1125 » On Conditional Covering Problem |
166
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
144
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
168
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...
218
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
159
click to vote
DISOPT
2006
15 years 6 months ago
2006
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...