Sciweavers

2168 search results - page 260 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
CASCON
1996
160views Education» more  CASCON 1996»
15 years 5 months ago
Automatic generation of performance models for distributed application systems
Organizations have become increasingly dependent on computing systems to achieve their business goals. The performance of these systems in terms of response times and cost has a m...
M. Qin, R. Lee, Asham El Rayess, Vidar Vetland, Je...
BMVC
2010
15 years 2 months ago
Joint Modeling of Algorithm Behavior and Image Quality for Algorithm Performance Prediction
In this paper, we propose a framework for predicting the performance of a vision algorithm given the input image or video so as to maximize the algorithm's ability to provide...
Apurva Gala, Shishir Shah
DAC
2010
ACM
15 years 7 months ago
On the costs and benefits of stochasticity in stream processing
With the end of clock-frequency scaling, parallelism has emerged as the key driver of chip-performance growth. Yet, several factors undermine efficient simultaneous use of onchip ...
Raj R. Nadakuditi, Igor L. Markov
SIGGRAPH
1993
ACM
15 years 8 months ago
Combining hierarchical radiosity and discontinuity meshing
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
Dani Lischinski, Filippo Tampieri, Donald P. Green...
WEBI
2010
Springer
15 years 2 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan