2517 search results - page 11 / 504 » Specifying Weak Sets |
TIP
2010
13 years 2 months ago
2010
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
MKWI
2008
13 years 8 months ago
2008
Abstract: In order to fulfil sets of similar user requirements within a specific application domain, one typically uses software product line engineering. In this paper, we investi...
ACL
2006
13 years 8 months ago
2006
This work provides the essential foundations for modular construction of (typed) unification grammars for natural languages. Much of the information in such grammars is encoded in...
IPL
2002
13 years 7 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...