1818 search results - page 328 / 364 » Granularity-Adaptive Proof Presentation |
135
click to vote
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
137
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
106
click to vote
LFCS
2007
Springer
15 years 9 months ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
124
Voted
OTM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Protocols that govern the interactions between software components are a popular means to support the construction of correct component-based systems. Previous studies ha...
111
Voted
OTM
2007
Springer
15 years 9 months ago
2007
Springer
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...