126 search results - page 4 / 26 » Surrogate constraint normalization for the set covering prob... |
PAMI
2007
13 years 6 months ago
2007
Many visual cues for surface reconstruction from known views are sparse in nature, e.g. specularities, surface silhouettes and salient features in an otherwise textureless region....
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
MICS
2010
13 years 2 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
EAAI
2010
13 years 6 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
APPROX
2004
Springer
14 years 24 days ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....