9842 search results - page 282 / 1969 » The Complexity of the Matching-Cut Problem |
204
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
The key of overlapping structures or concurrent markup hierarchies in XML encodings of documents is that markup in one hierarchy is not necessarily well-formed with respect to the...
108
Voted
VMCAI
2010
Springer
16 years 26 days ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
128
Voted
ER
2007
Springer
15 years 9 months ago
2007
Springer
The major purpose of the design of distributed databases is to improve system performance and to increase system reliability. Fragmentation and allocation play important roles in t...
140
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
131
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...