Sciweavers

1068 search results - page 56 / 214
» For completeness, sublogarithmic space is no space
Sort
View
ICALP
2010
Springer
14 years 1 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
APAL
2010
141views more  APAL 2010»
13 years 8 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
WG
2010
Springer
13 years 7 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ESWS
2009
Springer
14 years 3 months ago
Cupboard - A Place to Expose Your Ontologies to Applications and the Community
In this demo, we present the Cupboard system for ontology publishing, sharing and reuse. This system is intended to support both ontology engineers and ontology users/practitioners...
Mathieu d'Aquin, Holger Lewen
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno