925 search results - page 38 / 185 » Connectivity on Complete Lattices |
TABLEAUX
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
100
click to vote
ICOIN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--This paper explores the computation and communication overlap capabilities enabled by the new CORE-Direct hardware capabilities introduced in the InfiniBand (IB) Host Cha...
IJSN
2006
14 years 11 months ago
2006
: In order to conceal their identity and origin, network based intruders seldom attack directly from their own hosts, but rather stage their attacks through intermediate `stepping ...
100
click to vote
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and ...