2473 search results - page 239 / 495 » The Logic of Communication Graphs |
164
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
181
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
188
click to vote
CRYPTO
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
189
click to vote
INFOCOM
2005
IEEE
16 years 8 days ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
188
click to vote
MOBICOM
2004
ACM
16 years 3 days ago
2004
ACM
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...