Sciweavers

66 search results - page 1 / 14
» How a simple shift can significantly improve the performance...
Sort
View
ICIP
2002
IEEE
14 years 6 months ago
How a simple shift can significantly improve the performance of linear interpolation
We present a simple, original method to improve piecewise linear interpolation with uniform knots: We shift the sampling knots by a fixed amount, while enforcing the interpolation...
Michael Unser, Philippe Thévenaz, Thierry B...
AAAI
2000
13 years 6 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
DAC
2005
ACM
13 years 6 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
ICASSP
2010
IEEE
13 years 5 months ago
Acoustic model adaptation via Linear Spline Interpolation for robust speech recognition
We recently proposed a new algorithm to perform acoustic model adaptation to noisy environments called Linear Spline Interpolation (LSI). In this method, the nonlinear relationshi...
Michael L. Seltzer, Alex Acero, Kaustubh Kalgaonka...
EUROCRYPT
1998
Springer
13 years 9 months ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...