107 search results - page 13 / 22 » Combinatorial dichotomies in set theory |
CORR
1999
Springer
13 years 8 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
DISOPT
2011
13 years 2 days ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
SIBGRAPI
1999
IEEE
14 years 25 days ago
1999
IEEE
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
AML
2008
13 years 8 months ago
2008
Abstract. We say that a coloring c : []n 2 is continuous if it is continuous with respect to some second countable topology on . A coloring c is potentially continuous if it is co...