Sciweavers

4255 search results - page 67 / 851
» Cover
Sort
View
TIT
2008
122views more  TIT 2008»
13 years 10 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
JCT
2002
107views more  JCT 2002»
13 years 9 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
MST
2010
117views more  MST 2010»
13 years 8 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
TCS
2010
13 years 8 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
IEAAIE
2010
Springer
13 years 8 months ago
Using Remote Data Mining on LIDAR and Imagery Fusion Data to Develop Land Cover Maps
Remote sensing based on imagery has traditionally been the main tool used to extract land uses and land cover (LULC) maps. However, more powerful tools are needed in order to fulfi...
Jorge García-Gutiérrez, Francisco Ma...