10819 search results - page 112 / 2164 » Addition and multiplication of sets |
CVPR
2004
IEEE
13 years 11 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
ACSC
2003
IEEE
13 years 11 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
DAGSTUHL
2006
13 years 9 months ago
2006
Abstract. Within Self-reconfiguring systems two basic problems arise: on instruction level, reconfigurable instruction sets make program generation and execution inherently difficu...
TCS
2008
13 years 7 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
COMBINATORICS
1998
13 years 7 months ago
1998
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...