Sciweavers

646 search results - page 35 / 130
» Generalized connected domination in graphs
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
CONEXT
2005
ACM
13 years 10 months ago
Root cause analysis for long-lived TCP connections
While the applications using the Internet have changed over time, TCP is still the dominating transport protocol that carries over 90% of the total traffic. Throughput is the key...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 9 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
14 years 2 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
DM
2007
86views more  DM 2007»
13 years 8 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