Sciweavers

16404 search results - page 74 / 3281
» A set coverage problem
Sort
View
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
15 years 5 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara
AI
2001
Springer
15 years 5 months ago
A Case Study for Learning from Imbalanced Data Sets
We present our experience in applying a rule induction technique to an extremely imbalanced pharmaceutical data set. We focus on using a variety of performance measures to evaluate...
Aijun An, Nick Cercone, Xiangji Huang
IPL
2008
135views more  IPL 2008»
15 years 18 days ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
117
Voted
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
15 years 6 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
66
Voted
SIAMJO
2008
57views more  SIAMJO 2008»
15 years 16 days ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel