Sciweavers

641 search results - page 35 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
EUROSYS
2011
ACM
14 years 9 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...
NIPS
2004
15 years 7 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
ISCAS
2003
IEEE
84views Hardware» more  ISCAS 2003»
15 years 11 months ago
Performance optimization for motion compensated 2D wavelet video compression techniques
In this paper we present two performance optimization methods for a motion compensated (MC) 2D wavelet video coding technique, which is based on two of the current stateof-the-art...
Zhen Li, Feng Wu, Shipeng Li, Edward J. Delp
EVOW
2010
Springer
15 years 10 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu