Sciweavers

61 search results - page 5 / 13
» On Linear Secret Sharing for Connectivity in Directed Graphs
Sort
View
INFOCOM
2012
IEEE
11 years 9 months ago
Pssst, over here: Communicating without fixed infrastructure
—This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer syste...
Tom Callahan, Mark Allman, Michael Rabinovich
INFOCOM
2010
IEEE
13 years 5 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...
ICIP
2008
IEEE
14 years 9 months ago
Graph-based deinterlacing
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
Jérôme Roussel, Pascal Bertolino
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
14 years 1 days ago
On the security of linear consensus networks
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...
Fabio Pasqualetti, Antonio Bicchi, Francesco Bullo
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård