Sciweavers

2412 search results - page 47 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 10 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
CORR
2006
Springer
52views Education» more  CORR 2006»
13 years 10 months ago
A SIMO Fiber Aided Wireless Network Architecture
Abstract-- The concept of a fiber aided wireless network architecture (FAWNA) is introduced in [Ray et al., Allerton Conference 2005], which allows high-speed mobile connectivity b...
Siddharth Ray, Muriel Médard, Lizhong Zheng
ICDE
2004
IEEE
127views Database» more  ICDE 2004»
14 years 11 months ago
Lazy Database Replication with Ordering Guarantees
Lazy replication is a popular technique for improving the performance and availability of database systems. Although there are concurrency control techniques which guarantee seria...
Khuzaima Daudjee, Kenneth Salem
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 10 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
ACSAC
2003
IEEE
14 years 3 months ago
Efficient Minimum-Cost Network Hardening Via Exploit Dependency Graphs
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
Steven Noel, Sushil Jajodia, Brian O'Berry, Michae...