2150 search results - page 92 / 430 » On a restricted cross-intersection problem |
149
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
118
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
134
click to vote
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
121
click to vote
LOPSTR
2004
Springer
15 years 10 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
121
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...