4066 search results - page 99 / 814 » Almost Complete Sets |
146
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
156
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
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...
174
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
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...
163
click to vote
SLOGICA
2008
15 years 6 months ago
2008
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...
160
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
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...