1299 search results - page 30 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Model-based testing as a black-box testing technique has grown in importance. The models used represent the relevant features of the system under consideration (SUC), and can also...
81
Voted
NAACL
2010
14 years 7 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
DIS
2007
Springer
15 years 3 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
DAC
2004
ACM
15 years 1 months ago
2004
ACM
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests ...