Sciweavers

1019 search results - page 4 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
IPPS
2005
IEEE
13 years 11 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
CCCG
2010
13 years 7 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ICPR
2008
IEEE
14 years 15 days ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato
ICA
2007
Springer
14 years 6 days ago
Robust Independent Component Analysis Using Quadratic Negentropy
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
Jaehyung Lee, Taesu Kim, Soo-Young Lee
NAACL
2007
13 years 7 months ago
High-Performance, Language-Independent Morphological Segmentation
This paper introduces an unsupervised morphological segmentation algorithm that shows robust performance for four languages with different levels of morphological complexity. In p...
Sajib Dasgupta, Vincent Ng