Sciweavers

2810 search results - page 157 / 562
» Dynamic Virtual Clustering
Sort
View
VLDB
1998
ACM
132views Database» more  VLDB 1998»
15 years 8 months ago
Buffering and Read-Ahead Strategies for External Mergesort
The elapsed time for external mergesort is normally dominated by I/O time. This paper is focused on reducing I/O time during the merge phase. Three new buffering and readahead str...
Weiye Zhang, Per-Åke Larson
130
Voted
IDEAL
2000
Springer
15 years 7 months ago
Observational Learning with Modular Networks
Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Hyunjung Shin, Hyoungjoo Lee, Sungzoon Cho
WSC
2007
15 years 6 months ago
Real-time prediction in a stochastic domain via similarity-based data-mining
This paper introduces an application and a methodology to predict future states of a process under real-time requirements. The real-time functionality is achieved by creating a Ba...
Timo Steffens, Philipp Hügelmeyer
HAPTICS
2006
IEEE
15 years 10 months ago
Perceptual Analysis of Haptic Icons: an Investigation into the Validity of Cluster Sorted MDS
The design of usable haptic icons (brief informational signals delivered through the sense of touch) requires a tool for measuring perceptual distances between icons that will be ...
Jérôme Pasquero, Joseph Luk, Shannon ...
CLOUD
2010
ACM
15 years 9 months ago
Hermes: clustering users in large-scale e-mail services
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
Thomas Karagiannis, Christos Gkantsidis, Dushyanth...