Sciweavers

489 search results - page 64 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
COLT
2007
Springer
15 years 4 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
ASIACRYPT
2005
Springer
15 years 4 months ago
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
Zhifang Zhang, Mulan Liu, Liangliang Xiao
HPCN
1998
Springer
15 years 2 months ago
PARAFLOW: A Dataflow Distributed Data-Computing System
We describe the Paraflow system for connecting heterogeneous computing services together into a flexible and efficient data-mining metacomputer. There are three levels of parallel...
Roy Williams, Bruce Sears
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
15 years 2 months ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 18 days ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer