967 search results - page 143 / 194 » Probabilistic Predicative Programming |
181
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
140
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
137
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
OOPSLA
2005
Springer
15 years 8 months ago
2005
Springer
As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple f...
133
click to vote
AOSD
2003
ACM
15 years 7 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...