Sciweavers

2374 search results - page 155 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
TSP
2010
14 years 9 months ago
ARMA signals with specified symmetric marginal probability distribution
Except in the case of normal (i.e Gaussian) distribution, it is very difficult to calculate the marginal probability distribution of ARMA signals. By using a particular form of mo...
Bernard C. Picinbono
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
15 years 7 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
MICCAI
2005
Springer
16 years 3 months ago
A Fast-Marching Approach to Cardiac Electrophysiology Simulation for XMR Interventional Imaging
Cardiac ablation procedures are becoming more routine to treat arrhythmias. The development of electrophysiological models will allow investigation of treatment strategies. However...
Maxime Sermesant, Yves Coudière, Valé...
PPSN
2010
Springer
15 years 27 days ago
Privacy-Preserving Multi-Objective Evolutionary Algorithms
Existing privacy-preserving evolutionary algorithms are limited to specific problems securing only cost function evaluation. This lack of functionality and security prevents thei...
Daniel Funke, Florian Kerschbaum
125
Voted
PDP
2006
IEEE
15 years 8 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller