Sciweavers

3113 search results - page 226 / 623
» Numerical Methods
Sort
View
ICASSP
2011
IEEE
14 years 10 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
ARITH
2009
IEEE
16 years 1 months ago
Fast and Accurate Bessel Function Computation
The Bessel functions are considered relatively difficult to compute. Although they have a simple power series expansion that is everywhere convergent, they exhibit approximately ...
John Harrison
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
16 years 12 days ago
Gait Generation for Passive Running via Iterative Learning Control
Abstract— This paper proposes a novel framework to generate optimal passive gait trajectories for a planar one-legged hopping robot via iterative learning control. The proposed m...
Satoshi Satoh, Kenji Fujimoto, Sang-Ho Hyon
FSTTCS
2008
Springer
15 years 7 months ago
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Georg Moser, Andreas Schnabl, Johannes Waldmann
MP
2006
80views more  MP 2006»
15 years 6 months ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels