2661 search results - page 180 / 533 » Quantum Complexity Classes |
183
Voted
ICCV
1999
IEEE
16 years 4 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
142
click to vote
ICDAR
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
127
Voted
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
132
Voted
ICRA
1998
IEEE
15 years 7 months ago
1998
IEEE
For a system of cooperative mobile robots to be effective in real-world applications, it must be able to efficiently execute a wide class of complex tasks in potentially unknown a...