6266 search results - page 70 / 1254 » New results on the computability and complexity of points - ... |
FLOPS
2010
Springer
14 years 3 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
IJHPCA
2008
13 years 8 months ago
2008
Principal component analysis (PCA) is an effective tool for spectral decorrelation of hyperspectral imagery, and PCA-based spectral transforms have been employed successfully in co...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
ICCV
2005
IEEE
14 years 10 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...