Sciweavers

256 search results - page 22 / 52
» Recursive Lattice Reduction
Sort
View
POPL
2000
ACM
13 years 12 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
VISUALIZATION
1994
IEEE
13 years 11 months ago
A Lattice Model for Data Display
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
ICASSP
2011
IEEE
12 years 11 months ago
Synthesis filter bank optimization with lattice structure constraints in 2D separable image processing
In one-dimensional signal processing, the perfect reconstruction (PR) synthesis FB is not unique for a given analysis LP oversampled filter bank (FB). Optimal Design methods have...
Li Chai, Yuxia Sheng, Jingxin Zhang
PLDI
2012
ACM
11 years 10 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
ICPR
2008
IEEE
14 years 2 months ago
Edge-preserving unscented Kalman filter for speckle reduction
We propose a recursive spatial-domain speckle reduction algorithm for synthetic aperture radar (SAR) imagery based on the unscented Kalman filter (UKF) with a discontinuity-adapt...
Gorthi R. K. Sai Subrahmanyam, A. N. Rajagopalan, ...