5891 search results - page 941 / 1179 » On the Computational Security of a Distributed Key Distribut... |
163
click to vote
ISI
2008
Springer
15 years 6 months ago
2008
Springer
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
206
click to vote
IANDC
2007
15 years 6 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
226
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
186
click to vote
INFOCOM
2008
IEEE
16 years 28 days ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
187
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...