4903 search results - page 33 / 981 » The Set Covering Machine |
MVA
2007
13 years 9 months ago
2007
In this paper a new approach to finding and tracking various land cover boundaries such as rivers, agricultural fields, channels and roads for use in visual navigation system of a...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
IVC
2007
13 years 7 months ago
2007
This paper presents a solution to the cloud removal problem, based in a recently developed image fusion methodology consisting in applying a 1-D pseudo-Wigner distribution (PWD) t...
COMBINATORICS
2004
13 years 7 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
HICSS
2009
IEEE
14 years 2 months ago
2009
IEEE
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...