10 search results - page 2 / 2 » Computational Complexity of Itemset Frequency Satisfiability |
PKDD
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
CINQ
2004
Springer
13 years 9 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...
MICCAI
1998
Springer
13 years 9 months ago
1998
Springer
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...