2827 search results - page 187 / 566 » Robustness of PSPACE-complete sets |
118
click to vote
ALT
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
150
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
155
click to vote
BMVC
2002
15 years 6 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
127
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
133
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...