Sciweavers

408 search results - page 64 / 82
» Quantitative Models and Implicit Complexity
Sort
View
SKG
2006
IEEE
14 years 1 months ago
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
Jinjun Chen, Yun Yang
INFOCOM
2005
IEEE
14 years 1 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
ICANN
2005
Springer
14 years 1 months ago
Accurate and Robust Image Superresolution by Neural Processing of Local Image Representations
Image superresolution involves the processing of an image sequence to generate a still image with higher resolution. Classical approaches, such as bayesian MAP methods, require ite...
Carlos Miravet, Francisco de Borja Rodrígue...
RTCSA
2000
IEEE
13 years 12 months ago
Scheduling optional computations in fault-tolerant real-time systems
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mo...
CGI
1999
IEEE
13 years 12 months ago
Volume Decimation of Irregular Tetrahedral Grids
Rendering highly complex models can be time and space prohibitive, and decimation is an important tool in providing simplifications. A decimated model may replace the original ent...
Allen Van Gelder, Vivek Verma, Jane Wilhelms