9842 search results - page 117 / 1969 » The Complexity of the Matching-Cut Problem |
PODC
2012
ACM
12 years 16 days ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
ESANN
1998
13 years 11 months ago
1998
Our problem concerns the joint interpretation of UltraSonic and InfraRed measurements provided by a composite proximity sensor, in order to extract geometrical and morphological f...
INFORMATICALT
2002
13 years 9 months ago
2002
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
FSTTCS
1993
Springer
14 years 2 months ago
1993
Springer
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete f...