2827 search results - page 492 / 566 » Robustness of PSPACE-complete sets |
152
click to vote
CAMP
2005
IEEE
15 years 6 months ago
2005
IEEE
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...
137
Voted
ECCV
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We propose a new method for face recognition under arbitrary pose and illumination conditions, which requires only one training image per subject. Furthermore, no limitat...
105
click to vote
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
AUSAI
2003
Springer
15 years 6 months ago
2003
Springer
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
103
click to vote
STOC
1997
ACM
15 years 5 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...