Sciweavers

4342 search results - page 55 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
WSC
2001
13 years 9 months ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...
ICASSP
2008
IEEE
14 years 2 months ago
An improved mu-law proportionate NLMS algorithm
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...
Ligang Liu, Masahiro Fukumoto, Sachio Saiki
PAMI
2008
208views more  PAMI 2008»
13 years 7 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
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...
JSC
2007
80views more  JSC 2007»
13 years 7 months ago
Improved dense multivariate polynomial factorization algorithms
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-...
Grégoire Lecerf
CASES
2007
ACM
13 years 9 months ago
Facilitating compiler optimizations through the dynamic mapping of alternate register structures
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...