Sciweavers

2168 search results - page 328 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
187
Voted
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 6 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 6 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
IPPS
2005
IEEE
15 years 9 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
AVBPA
2005
Springer
320views Biometrics» more  AVBPA 2005»
15 years 9 months ago
A Principled Approach to Score Level Fusion in Multimodal Biometric Systems
A multimodal biometric system integrates information from multiple biometric sources to compensate for the limitations in performance of each individual biometric system. We propos...
Sarat C. Dass, Karthik Nandakumar, Anil K. Jain
SC
2009
ACM
15 years 10 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
Fengguang Song, Asim YarKhan, Jack Dongarra