146 search results - page 12 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
We address the problem of automatic 3D segmentation of a stack of electron microscopy sections of brain tissue. Unlike previous efforts, where the reconstruction is usually done o...
GC
2006
Springer
13 years 9 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
ALGORITHMICA
2007
13 years 10 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
ASP
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
ICPR
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper, stochastic error-correcting parsing is proposed as a powerful and flexible method to post-process the results of an optical character recognizer (OCR). Determinist...