Sciweavers

4218 search results - page 137 / 844
» Complete sets of cooperations
Sort
View
DATE
2009
IEEE
106views Hardware» more  DATE 2009»
14 years 5 months ago
Generation of compact test sets with high defect coverage
Abstract-Multi-detect (N-detect) testing suffers from the drawback that its test length grows linearly with N. We present a new method to generate compact test sets that provide hi...
Xrysovalantis Kavousianos, Krishnendu Chakrabarty
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 2 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
SLOGICA
2008
116views more  SLOGICA 2008»
13 years 10 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 5 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
NMR
2004
Springer
14 years 3 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea