Sciweavers

2556 search results - page 239 / 512
» Clustering processes
Sort
View
CLUSTER
2006
IEEE
16 years 20 days ago
Positioning Dynamic Storage Caches for Transient Data
Simulations, experiments and observatories are generating a deluge of scientific data. Even more staggering is the ever growing application demand to process and assimilate these...
Sudharshan S. Vazhkudai, Douglas Thain, Xiaosong M...
IEEEPACT
2002
IEEE
15 years 11 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
ADC
2007
Springer
183views Database» more  ADC 2007»
15 years 10 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
CIKM
2006
Springer
15 years 10 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
HIS
2004
15 years 8 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...