327 search results - page 51 / 66 » On the structure of the Medvedev lattice |
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
A limitation of most speech recognizers is that they only recognize words from a fixed vocabulary. In this paper, we explore a technique for addressing this deficiency using aut...
ICCS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms...
COOPIS
2004
IEEE
13 years 11 months ago
2004
IEEE
An innate characteristic of the development of ontologies is that they are often created by independent groups of expertise, which generates the necessity of merging and aligning o...
DGCI
2009
Springer
13 years 10 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...