71 search results - page 13 / 15 » Decidability Under the Well-Founded Semantics |
EUROPAR
2003
Springer
15 years 2 months ago
2003
Springer
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
SPATIALCOGNITION
1998
Springer
15 years 1 months ago
1998
Springer
This paper investigates geometric and ontological aspects of shape concepts underlying the semantics of nouns. Considering the German shape nouns Ecke and Knick (corner and kink) w...
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
76
Voted
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
78
Voted
AI
2007
Springer
14 years 9 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...