Sciweavers

14 search results - page 3 / 3
» ipl 2011
Sort
View
IPL
2011
73views more  IPL 2011»
13 years 4 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
IPL
2011
63views more  IPL 2011»
13 years 4 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt
IPL
2011
91views more  IPL 2011»
13 years 4 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
IPL
2011
96views more  IPL 2011»
13 years 3 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay