517 search results - page 92 / 104 » Near-Deterministic Inference of AS Relationships |
117
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
114
Voted
KDD
2007
ACM
16 years 25 days ago
2007
ACM
Documents, such as those seen on Wikipedia and Folksonomy, have tended to be assigned with multiple topics as a meta-data. Therefore, it is more and more important to analyze a re...
200
Voted
POPL
2004
ACM
16 years 22 days 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...
221
Voted
POPL
2003
ACM
16 years 22 days 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...
158
click to vote
SIGMOD
2008
ACM
16 years 17 days ago
2008
ACM
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...