5074 search results - page 959 / 1015 » Personalization for the Semantic Web |
298
click to vote
POPL
2004
ACM
16 years 6 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...
298
click to vote
POPL
2003
ACM
16 years 6 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...
151
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
256
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
274
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...