Sciweavers

4797 search results - page 40 / 960
» The complexity of partition tasks
Sort
View
DATE
1999
IEEE
138views Hardware» more  DATE 1999»
14 years 1 months ago
Codex-dp: Co-design of Communicating Systems Using Dynamic Programming
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
Jui-Ming Chang, Massoud Pedram
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
13 years 7 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
CGI
1998
IEEE
14 years 1 months ago
Memory Management Schemes for Radiosity Computation in Complex Environments
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
Daniel Meneveaux, Kadi Bouatouch, Eric Maisel
JPDC
2006
146views more  JPDC 2006»
13 years 8 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
PAMI
2006
122views more  PAMI 2006»
13 years 8 months ago
Polarimetric Image Segmentation via Maximum-Likelihood Approximation and Efficient Multiphase Level-Sets
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj