Results 141 to 150 of about 2,347,375 (169)
Neonatal pose estimation in the unaltered clinical environment with fusion of RGB, depth and IR images. [PDF]
NPJ Digit MedGrafton A +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Canadian Journal of Mathematics, 1980
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
openaire +2 more sources
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
openaire +2 more sources
Approximating Min-sum Set Cover
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feige, Uriel +2 more
openaire +1 more source
Set Cover Problems with Small Neighborhood Covers
Theory of Computing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agarwal, Archita +4 more
openaire +2 more sources
Operations Research, 1972
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Balas, Egon, Padberg, Manfred W.
openaire +2 more sources
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Balas, Egon, Padberg, Manfred W.
openaire +2 more sources
The Probabilistic Set-Covering Problem
Operations Research, 2002In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound ...
BERALDI, Patrizia, RUSZCZYNSKI A.
openaire +3 more sources
Sbornik: Mathematics, 2010
Problems connected with the classical Borsuk problem on partitioning a?set in Euclidean space into subsets of smaller diameter, and also connected with the Nelson-Hadwiger problem on the chromatic number of Euclidean space, are studied. New bounds are obtained for the quantities and , where the suprema are taken over all sets of unit diameter on a ...
openaire +1 more source
Problems connected with the classical Borsuk problem on partitioning a?set in Euclidean space into subsets of smaller diameter, and also connected with the Nelson-Hadwiger problem on the chromatic number of Euclidean space, are studied. New bounds are obtained for the quantities and , where the suprema are taken over all sets of unit diameter on a ...
openaire +1 more source
Set Covering and Involutory Bases
Management Science, 1971Some new properties associated with the special class of integer programs known as weighted set covering problems are derived. While it is well known that an optimal integer solution to the set covering problem is a basic feasible solution to the corresponding linear program, we show that there exists an optimal basis which is involutory (i.e., B = B ...
Mandell Bellmore, H. Donald Ratliff
openaire +2 more sources