465 search results - page 43 / 93 » On the Hardness of Range Assignment Problems |
MICCAI
2004
Springer
16 years 22 days ago
2004
Springer
We propose an original approach for the segmentation of three-dimensional fields of probability density functions. This presents a wide range of applications in medical images proc...
SAT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
STACS
1999
Springer
15 years 4 months ago
1999
Springer
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
ITC
1998
IEEE
15 years 4 months ago
1998
IEEE
Existing high-level BIST synthesis methods focus on one objective, minimizing either area overhead or test time. Hence, those methods do not render exploration of large design spa...
113
click to vote
COMPASS
1991
15 years 3 months ago
1991
: We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the sem...