1169 search results - page 56 / 234 » Degrees of monotone complexity |
178
click to vote
BVAI
2005
Springer
15 years 11 months ago
2005
Springer
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
191
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
154
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
138
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
185
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
This paper investigates ordinal image description for
invariant feature correspondence. Ordinal description is
a meta-technique which considers image measurements in
terms of th...