139 search results - page 4 / 28 » Fast perfect sampling from linear extensions |
AUTOMATICA
2002
13 years 7 months ago
2002
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
CSDA
2011
13 years 2 months ago
2011
This paper proposes a new method of interval estimation for the long run response (or elasticity) parameter from a general linear dynamic model. We employ the biascorrected bootst...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Auto parking techniques are attracting more attention these days. In this paper, we develop an image-based method to estimate the depth contour in parking areas. Our algorithm is ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...