1410 search results - page 71 / 282 » Proving theorems by reuse |
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
SIAMMA
2010
13 years 4 months ago
2010
This work deals with trace theorems for a class of ramified bidimensional domains with a self-similar fractal boundary . The fractal boundary is supplied with a probability measur...
SEMWEB
2007
Springer
14 years 4 months ago
2007
Springer
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. ...
CICLING
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...
VLSID
2006
IEEE
14 years 4 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N