429 search results - page 20 / 86 » Noisy Turing Machines |
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
COCO
2010
Springer
13 years 9 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce a text-based image feature and demon-
strate that it consistently improves performance on hard
object classification problems. The feature is built using
an auxilia...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
A good model of object shape is essential in applications such as segmentation, object detection, inpainting and graphics. For example, when performing segmentation, local constra...