Sciweavers

366 search results - page 1 / 74
» Towards a Complexity Model for Design and Analysis of PGAS-B...
Sort
View
HPCC
2007
Springer
13 years 11 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
SIGSOFT
2003
ACM
14 years 5 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
ICIP
2003
IEEE
14 years 6 months ago
Towards objective performance analysis for estimation of complex motion: analytic motion modeling, filter optimization, and test
This paper deals with several aspects towards a more objective performance analysis of low-level motion analysis. A generalized spatiotemporal filter formulation and motion modeli...
Bernd Jähne, Christoph S. Garbe
UAI
2001
13 years 6 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
INFOCOM
2009
IEEE
13 years 11 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang