Sciweavers

2020 search results - page 191 / 404
» Speeding up Slicing
Sort
View
AUSAI
2003
Springer
14 years 3 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
IPPS
2002
IEEE
14 years 3 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim
IUI
2009
ACM
14 years 3 months ago
Simplified facial animation control utilizing novel input devices: a comparative study
Editing facial expressions of virtual characters is quite a complex task. The face is made up of many muscles, which are partly activated concurrently. Virtual faces with human exp...
Nikolaus Bee, Bernhard Falk, Elisabeth André
MSR
2009
ACM
14 years 3 months ago
MapReduce as a general framework to support research in Mining Software Repositories (MSR)
Researchers continue to demonstrate the benefits of Mining Software Repositories (MSR) for supporting software development and research activities. However, as the mining process...
Weiyi Shang, Zhen Ming Jiang, Bram Adams, Ahmed E....
ACML
2009
Springer
14 years 3 months ago
Improving Adaptive Bagging Methods for Evolving Data Streams
We propose two new improvements for bagging methods on evolving data streams. Recently, two new variants of Bagging were proposed: ADWIN Bagging and Adaptive-Size Hoeffding Tree (...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...