1445 search results - page 80 / 289 » Uniformly Hard Languages |
HPCC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider query execution strategies for object-oriented distributed databases. There are several scenarios of query decomposition, assuming that the corresponding quer...
WEBDB
2005
Springer
14 years 3 months ago
2005
Springer
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...
JAVA
2001
Springer
14 years 2 months ago
2001
Springer
Compile-time program optimizations are similar to poetry: more are written than are actually published in commercial compilers. Hard economic reality is that many interesting opti...
JAVA
1999
Springer
14 years 2 months ago
1999
Springer
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. The Java memory model is hard to interp...
ACL
2006
13 years 11 months ago
2006
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...