552 search results - page 10 / 111 » On the Complexity of Join Predicates |
CAISE
1992
Springer
13 years 10 months ago
1992
Springer
In many non trivial application domains, object types with a complex structure occur. Data modelling techniques which only allow flat structures are not suitable for representing ...
ICSE
2007
IEEE-ACM
14 years 6 months ago
2007
IEEE-ACM
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
IFIP
2004
Springer
14 years 2 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
IANDC
2006
13 years 6 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
CGO
2003
IEEE
14 years 6 hour ago
2003
IEEE
Predicated execution can eliminate hard to predict branches and help to enable instruction level parallelism. Many current predication variants exist where the result update is co...