9842 search results - page 1607 / 1969 » The Complexity of the Matching-Cut Problem |
174
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
173
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
298
click to vote
VLDB
2003
ACM
16 years 7 months ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
251
click to vote
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
285
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...