5818 search results - page 1134 / 1164 » A reasonable Semantic Web |
218
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
234
click to vote
POPL
2003
ACM
16 years 2 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
245
click to vote
POPL
2001
ACM
16 years 2 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
201
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
204
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...