Sciweavers

2095 search results - page 391 / 419
» Improved pebbling bounds
Sort
View
IFIP
2009
Springer
14 years 4 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
SAT
2009
Springer
113views Hardware» more  SAT 2009»
14 years 4 months ago
Exploiting Cycle Structures in Max-SAT
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
Chu Min Li, Felip Manyà, Nouredine Ould Moh...
MOBICOM
2009
ACM
14 years 4 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
CCGRID
2008
IEEE
14 years 4 months ago
Advanced RDMA-Based Admission Control for Modern Data-Centers
—Current data-centers employ admission control mechanism to maintain low response time and high throughput under overloaded scenarios. Existing mechanisms use internal (on the ov...
Ping Lai, Sundeep Narravula, Karthikeyan Vaidyanat...
NDSS
2008
IEEE
14 years 4 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion