406 search results - page 8 / 82 » Identifying Codes and Covering Problems |
IWDW
2005
Springer
14 years 2 months ago
2005
Springer
In a fingerprinting scheme a distributor places marks in each copy of a digital object. Placing different marks in different copies, uniquely identifies the recipient of each cop...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
Location-based applications and services are getting increasingly important for mobile users. They take into account a mobile user's current location and provide a location-d...
ML
2008
ACM
13 years 8 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
MST
2007
13 years 8 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...