9842 search results - page 1295 / 1969 » The Complexity of the Matching-Cut Problem |
195
click to vote
PSD
2004
Springer
16 years 24 days ago
2004
Springer
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
183
click to vote
SAS
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
186
click to vote
SAT
2004
Springer
16 years 24 days ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
191
click to vote
WAOA
2004
Springer
16 years 23 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
201
click to vote
WWW
2010
ACM
16 years 22 days ago
2010
ACM
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...