9842 search results - page 1661 / 1969 » The Complexity of the Matching-Cut Problem |
147
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
166
click to vote
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
The knowledge required to develop complex software has historically existed in programming folklore, the heads of experienced developers, or buried deep in the code. These locatio...
109
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
161
click to vote
ICDT
2010
ACM
16 years 2 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
151
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...