Sciweavers

3383 search results - page 355 / 677
» Distributing the power of OLAP
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
16 years 4 days ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
ICDM
2003
IEEE
119views Data Mining» more  ICDM 2003»
16 years 4 days ago
A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering
Clustering by document concepts is a powerful way of retrieving information from a large number of documents. This task in general does not make any assumption on the data distrib...
Chihli Hung, Stefan Wermter
175
Voted
PPOPP
2003
ACM
16 years 2 days ago
The design and implementation of a parallel array operator for the arbitrary remapping of data
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...
Steven J. Deitz, Bradford L. Chamberlain, Sung-Eun...
MCS
2010
Springer
15 years 12 months ago
Online Non-stationary Boosting
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
HPDC
2002
IEEE
15 years 11 months ago
Design and Evaluation of a Resource Selection Framework for Grid Applications
While distributed, heterogeneous collections of computers (“Grids”) can in principle be used as a computing platform, in practice the problems of first discovering and then co...
Chuang Liu, Lingyun Yang, Ian T. Foster, Dave Angu...