Sciweavers

11381 search results - page 383 / 2277
» Connectivity
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Interval consensus: From quantized gossip to voting
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Inst...
Florence Bénézit, Patrick Thiran, Ma...
ISW
2009
Springer
16 years 1 months ago
Security Analysis of the PACE Key-Agreement Protocol
We analyze the Password Authenticated Connection Establishment (PACE) protocol for authenticated key agreement, recently proposed by the German Federal Office for Information Secur...
Jens Bender, Marc Fischlin, Dennis Kügler
FOCS
2008
IEEE
16 years 1 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
HICSS
2007
IEEE
99views Biometrics» more  HICSS 2007»
16 years 1 months ago
The Internet of Things - Context-based Device Federations
Locating physical devices and accessing their functionality in pervasive environments is strongly restricted by their locality. Since there are more and more devices available, wa...
Andreas Heil, Mirko Knoll, Torben Weis
ICC
2007
IEEE
16 years 1 months ago
p-Cycle Network Design for Specified Minimum Dual-Failure Restorability
— Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important for carriers and network operators to consider them when ...
Wei Li, John Doucette, Ming Zuo