Sciweavers

1161 search results - page 141 / 233
» Approximation schemes for clustering problems
Sort
View
JSSPP
2005
Springer
14 years 1 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
WSC
2008
13 years 10 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi
INTERNET
2006
157views more  INTERNET 2006»
13 years 7 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 7 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
ICA
2010
Springer
13 years 8 months ago
An Alternating Minimization Method for Sparse Channel Estimation
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutt...