1548 search results - page 88 / 310 » Data sharing between ada and C C |
179
click to vote
ASWC
2008
Springer
15 years 8 months ago
2008
Springer
Ontology matching is a promising step towards the solution to the interoperability problem of the Semantic Web. Instance-based methods have the advantage of focusing on the most ac...
203
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
145
click to vote
IH
1998
Springer
15 years 10 months ago
1998
Springer
An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi e...
185
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
Communication between a pair of nodes in the network may get disrupted due to failures of links/nodes resulting in zero effective bandwidth between them during the recovery perio...
166
click to vote
EKAW
2008
Springer
15 years 8 months ago
2008
Springer
Despite the potential of domain ontologies to provide consensual representations of domain-relevant knowledge, the open, distributed and decentralized nature of the Semantic Web me...