1772 search results - page 175 / 355 » Classifying Problems into Complexity Classes |
159
click to vote
ICCV
1999
IEEE
16 years 2 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...
108
Voted
ICRA
1998
IEEE
15 years 5 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...
98
Voted
STACS
2000
Springer
15 years 4 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
78
Voted
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...