12 search results - page 2 / 3 » Optimal bounds on finding fixed points of contraction mappin... |
TIP
2010
12 years 12 months ago
2010
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
ICRA
1993
IEEE
13 years 9 months ago
1993
IEEE
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...
ICFP
2003
ACM
14 years 5 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
ICC
2009
IEEE
14 years 18 hour ago
2009
IEEE
—In this paper, we propose a multilevel coding (MLC) scheme suitable for satellite communications, where different QoS levels are required. We introduce a novel characterization ...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...