Sciweavers

2677 search results - page 142 / 536
» Locally Served Network Computers
Sort
View
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 5 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
WIOPT
2006
IEEE
15 years 11 months ago
Link modeling with joint fading and distance uncertainty
— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...
Martin Haenggi
LCN
2005
IEEE
15 years 11 months ago
Network Management Challenges for Next Generation Networks
Generally, current network management technologies follow two approaches: ITU-T’s recommendations for Telecommunication Management Network (TMN) and IETF’s Simple Network Mana...
Mo Li, Kumbesan Sandrasegaran
174
Voted
DMSN
2004
ACM
15 years 11 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
WIOPT
2010
IEEE
15 years 3 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...