905 search results - page 32 / 181 » On the Complexity of uSPR Distance |
100
click to vote
ICIP
2000
IEEE
16 years 24 days ago
2000
IEEE
New rotationally invariant texture feature extraction methods are introduced that utilise the dual tree complex wavelet transform (DT-CWT). The complex wavelet transform is a new ...
FSTTCS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...
ESA
2008
Springer
15 years 1 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
APPROX
2009
Springer
15 years 5 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
This paper presents a new feature extraction method for iris recognition. Since two dimensional complex wavelet transform (2D-CWT) does not only keep wavelet transform’s propert...