Sciweavers

380 search results - page 47 / 76
» On the Parallelization of the Sparse Grid Approach for Data ...
Sort
View
IPPS
2000
IEEE
14 years 3 days ago
ACDS: Adapting Computational Data Streams for High Performance
Data-intensive, interactive applications are an important class of metacomputing (Grid) applications. They are characterized by large, time-varying data flows between data provid...
Carsten Isert, Karsten Schwan
IPPS
2006
IEEE
14 years 1 months ago
Oblivious parallel probabilistic channel utilization without control channels
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
Christian Schindelhauer
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
14 years 8 months ago
A parallel learning algorithm for text classification
Text classification is the process of classifying documents into predefined categories based on their content. Existing supervised learning algorithms to automatically classify te...
Canasai Kruengkrai, Chuleerat Jaruskulchai
GLOBECOM
2009
IEEE
14 years 2 months ago
Multiple Target Localization Using Compressive Sensing
Abstract— In this paper, a novel multiple target localization approach is proposed by exploiting the compressive sensing theory, which indicates that sparse or compressible signa...
Chen Feng, Shahrokh Valaee, Zhenhui Tan
IPPS
2008
IEEE
14 years 2 months ago
Probabilistic allocation of tasks on desktop grids
While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput” applications...
Joshua Wingstrom, Henri Casanova