Sciweavers

1485 search results - page 30 / 297
» connection 2010
Sort
View
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 8 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou
PIMRC
2010
IEEE
13 years 7 months ago
Connectivity in wireless networks with dynamic key compromise and recovery
Abstract--This paper considers the problem of key management in wireless networks. In particular, we investigate the effect of dynamic key compromise and recovery on connectivity i...
Satashu Goel, Aylin Yener
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 4 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
CVPR
2010
IEEE
14 years 3 months ago
Exploiting Global Connectivity Constraints for Reconstruction of 3D Line Segments from Images
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
Arjun Jain, Christian Kurz, Thorsten Thormaehlen, ...
MDM
2010
Springer
194views Communications» more  MDM 2010»
13 years 12 months ago
Timing and Radius Considerations for Maintaining Connectivity QoS
—Given the potential scale on which a Wireless Sensor Network (WSN) can be deployed, multi-hop communication will be a pivotal component of the system. When redundant nodes are d...
Richard Tynan, Gregory M. P. O'Hare, Michael J. O'...