We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
In this paper, we propose an algorithm to improve the performance of the mu-law PNLMS algorithm (MPNLMS) for nonsparse impulse responses. Although the existing MPNLMS algorithm wa...
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
Chris Zimmer, Stephen Roderick Hines, Prasad Kulka...