3791 search results - page 80 / 759 » Packing sets of patterns |
KDD
2009
ACM
15 years 12 months ago
2009
ACM
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
107
click to vote
KDD
1997
ACM
15 years 3 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
DATE
2008
IEEE
15 years 5 months ago
2008
IEEE
N-detect test has been shown to have a higher likelihood for detecting defects. However, traditional definitions of Ndetect test do not necessarily exploit the localized characte...
EUROPAR
2000
Springer
15 years 2 months ago
2000
Springer
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...
SIGMOD
2000
ACM
15 years 3 months ago
2000
ACM
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...