163 search results - page 7 / 33 » Tight Approximability Results for Test Set Problems in Bioin... |
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
13 years 2 months ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
JCO
2008
13 years 7 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
FSTTCS
2004
Springer
14 years 26 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...