6105 search results - page 209 / 1221 » A Parallel Algorithm for Bound-Smoothing |
423
click to vote
IAJIT
2011
14 years 10 months ago
2011
: Many effective watermarking algorithms have been proposed and implemented for digital images and digital video, however, few algorithms have been proposed for audio watermarking....
164
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
145
click to vote
PPOPP
2005
ACM
15 years 12 months ago
2005
ACM
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
200
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
153
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...