Sciweavers

3508 search results - page 8 / 702
» Zero-Error Information Theory
Sort
View
IWMM
2011
Springer
217views Hardware» more  IWMM 2011»
14 years 14 days ago
On the theory and potential of LRU-MRU collaborative cache management
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can o...
Xiaoming Gu, Chen Ding
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...

Presentation
438views
16 years 8 months ago
Games with Incomplete Information
A talk on Nobel Talk by Nobel laureate John C Harsayni, in Topics in Game Theory Course, IISc, November 2008
JAIR
2012
254views Hardware» more  JAIR 2012»
13 years 8 hour ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...