Sciweavers

4124 search results - page 382 / 825
» Improved Algorithms for Data Migration
Sort
View
APCSAC
2005
IEEE
15 years 12 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
15 years 10 months ago
Visual Classification: An Interactive Approach to Decision Tree Construction
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
Mihael Ankerst, Christian Elsen, Martin Ester, Han...
KDD
1999
ACM
108views Data Mining» more  KDD 1999»
15 years 10 months ago
Mining the Most Interesting Rules
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
Roberto J. Bayardo Jr., Rakesh Agrawal
ICPP
1996
IEEE
15 years 10 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
TIP
2010
155views more  TIP 2010»
15 years 4 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He