1055 search results - page 20 / 211 » Enumerations in computable structure theory |
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
Great stride has been made in psychological research about primitives of visual perception, which is important to computer vision and image processing. In this paper, we propose a...
TCS
2008
13 years 10 months ago
2008
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...