Sciweavers

4124 search results - page 373 / 825
» Improved Algorithms for Data Migration
Sort
View
HIPC
2003
Springer
15 years 11 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
ACMMSP
2005
ACM
129views Hardware» more  ACMMSP 2005»
15 years 11 months ago
A locality-improving dynamic memory allocator
In general-purpose applications, most data is dynamically allocated. The memory manager therefore plays a crucial role in application performance by determining the spatial locali...
Yi Feng, Emery D. Berger
DAC
2001
ACM
16 years 7 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
ICML
2006
IEEE
16 years 7 months ago
Efficient co-regularised least squares regression
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
Stefan Wrobel, Thomas Gärtner, Tobias Scheffe...
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
16 years 6 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal