18 search results - page 3 / 4 » Iterative Fixed Point Computation for Type-Based Strictness ... |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
TIP
2010
13 years 2 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...
ICFP
2003
ACM
14 years 7 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...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discon...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents a decentralized approach to multiple target tracking. The novelty of this approach lies in the use of a set of autonomous while collaborative trackers to overc...