9842 search results - page 1498 / 1969 » The Complexity of the Matching-Cut Problem |
171
click to vote
FUZZY
2001
Springer
15 years 11 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
184
click to vote
ICAPR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
163
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
150
click to vote
ISW
2001
Springer
15 years 11 months ago
2001
Springer
This paper proposes a cryptographic mechanism for metering the duration and/or the number of instances of running a data process. This mechanism has the following property: knowing...
159
click to vote
IWANN
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. It is generally accepted that some of the problems and ambiguities at the low level of processing can not be resolved without taking into account contextual expectations....