123 search results - page 13 / 25 » Robust binary least squares: Relaxations and algorithms |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper deals with motion estimation and segmentation in video sequences. Some methods of motion computation between two consecutive frames of a video sequence are based on the...
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
102
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
108
click to vote
ICCAD
2010
IEEE
14 years 7 months ago
2010
IEEE
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...