Sciweavers

3941 search results - page 156 / 789
» Computational Efficiency of Batching Methods
Sort
View
AOR
2010
13 years 7 months ago
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
Javier Peña, Xavier Saynac, Juan Carlos Ver...
CVPR
2010
IEEE
14 years 6 months ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
CCGRID
2006
IEEE
14 years 4 months ago
Statistical Data Reduction for Efficient Application Performance Monitoring
There is a growing need for systems that can monitor and analyze application performance data automatically in order to deliver reliable and sustained performance to applications....
Lingyun Yang, Jennifer M. Schopf, Catalin Dumitres...
CAL
2006
13 years 10 months ago
An Efficient, Practical Parallelization Methodology for Multicore Architecture Simulation
Multiple core designs have become commonplace in the processor market, and are hence a major focus in modern computer architecture research. Thus, for both product development and ...
James Donald, Margaret Martonosi
ICASSP
2011
IEEE
13 years 1 months ago
Exploiting sparseness of backing-off language models for efficient look-ahead in LVCSR
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
David Nolden, Hermann Ney, Ralf Schlüter