Sciweavers

745 search results - page 123 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
345
Voted
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 4 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
INFOCOM
2007
IEEE
15 years 6 months ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya
RAID
1999
Springer
15 years 4 months ago
Mobile Agent Attack Resistant Distributed Hierarchical Intrusion Detection Systems
Distributed intrusion detection systems are especially vulnerable to attacks because the components reside at a static location and are connected together into a hierarchical stru...
Peter Mell, Mark McLarnon
PODC
2005
ACM
15 years 6 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
163
Voted
TIP
2010
145views more  TIP 2010»
14 years 7 months ago
Joint Manifolds for Data Fusion
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
Mark A. Davenport, Chinmay Hegde, Marco F. Duarte,...