Sciweavers

58 search results - page 12 / 12
» On Rank vs. Communication Complexity
Sort
View
JSAC
2010
153views more  JSAC 2010»
13 years 3 days ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
EDBT
2009
ACM
106views Database» more  EDBT 2009»
13 years 9 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...