Sciweavers

61 search results - page 4 / 13
» On Linear Secret Sharing for Connectivity in Directed Graphs
Sort
View
DM
2007
86views more  DM 2007»
13 years 7 months ago
Short cycle connectivity
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
Vladimir Batagelj, Matjaz Zaversnik
MOBISYS
2011
ACM
12 years 10 months ago
ProxiMate: proximity-based secure pairing using ambient wireless signals
Forming secure associations between wireless devices that do not share a prior trust relationship is an important problem. This paper presents ProxiMate, a system that allows wire...
Suhas Mathur, Robert C. Miller, Alexander Varshavs...
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
13 years 9 months ago
Synchronization in networks of identical linear systems
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
Luca Scardovi, Rodolphe Sepulchre
CMOT
2004
141views more  CMOT 2004»
13 years 7 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
GLOBECOM
2010
IEEE
13 years 4 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair